./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.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 e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:20:50,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:20:50,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:20:50,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:20:50,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:20:50,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:20:50,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:20:50,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:20:50,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:20:50,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:20:50,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:20:50,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:20:50,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:20:50,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:20:50,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:20:50,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:20:50,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:20:50,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:20:50,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:20:50,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:20:50,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:20:50,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:20:50,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:20:50,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:20:50,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:20:50,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:20:50,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:20:50,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:20:50,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:20:50,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:20:50,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:20:50,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:20:50,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:20:50,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:20:50,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:20:50,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:20:50,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:20:50,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:20:50,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:20:50,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:20:50,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:20:50,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:20:50,877 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 -> e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d [2024-11-16 16:20:51,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:20:51,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:20:51,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:20:51,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:20:51,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:20:51,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2024-11-16 16:20:52,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:20:52,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:20:52,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2024-11-16 16:20:52,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9832ed7d/916996d9f54c4ec88380a6e97f565d60/FLAGd1629a47f [2024-11-16 16:20:52,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9832ed7d/916996d9f54c4ec88380a6e97f565d60 [2024-11-16 16:20:52,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:20:52,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:20:52,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:20:52,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:20:52,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:20:52,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:20:52" (1/1) ... [2024-11-16 16:20:52,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc33e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:52, skipping insertion in model container [2024-11-16 16:20:52,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:20:52" (1/1) ... [2024-11-16 16:20:52,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:20:53,054 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-38.i[915,928] [2024-11-16 16:20:53,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:20:53,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:20:53,145 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-38.i[915,928] [2024-11-16 16:20:53,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:20:53,202 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:20:53,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53 WrapperNode [2024-11-16 16:20:53,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:20:53,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:20:53,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:20:53,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:20:53,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,267 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 16:20:53,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:20:53,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:20:53,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:20:53,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:20:53,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,301 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-16 16:20:53,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:20:53,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:20:53,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:20:53,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:20:53,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (1/1) ... [2024-11-16 16:20:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:20:53,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:20:53,371 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-16 16:20:53,376 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-16 16:20:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:20:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:20:53,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:20:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:20:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:20:53,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:20:53,504 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:20:53,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:20:53,818 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-16 16:20:53,819 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:20:53,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:20:53,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:20:53,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:20:53 BoogieIcfgContainer [2024-11-16 16:20:53,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:20:53,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:20:53,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:20:53,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:20:53,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:20:52" (1/3) ... [2024-11-16 16:20:53,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcaf26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:20:53, skipping insertion in model container [2024-11-16 16:20:53,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:53" (2/3) ... [2024-11-16 16:20:53,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcaf26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:20:53, skipping insertion in model container [2024-11-16 16:20:53,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:20:53" (3/3) ... [2024-11-16 16:20:53,850 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-38.i [2024-11-16 16:20:53,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:20:53,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:20:53,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:20:53,986 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;@50067eda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:20:53,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:20:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:20:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:20:54,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:20:54,010 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:20:54,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:20:54,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:20:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1915177393, now seen corresponding path program 1 times [2024-11-16 16:20:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:20:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320668718] [2024-11-16 16:20:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:20:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:20:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:20:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:20:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:20:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:20:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:20:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:20:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:20:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:20:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:20:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:20:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:20:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:20:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:20:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:20:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:20:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:20:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:20:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:20:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:20:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:20:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 16:20:54,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:20:54,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320668718] [2024-11-16 16:20:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320668718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:20:54,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:20:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:20:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372860257] [2024-11-16 16:20:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:20:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:20:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:20:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:20:54,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:20:54,488 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:20:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:20:54,519 INFO L93 Difference]: Finished difference Result 112 states and 182 transitions. [2024-11-16 16:20:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:20:54,522 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-16 16:20:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:20:54,531 INFO L225 Difference]: With dead ends: 112 [2024-11-16 16:20:54,532 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:20:54,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-16 16:20:54,540 INFO L432 NwaCegarLoop]: 79 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, 79 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-16 16:20:54,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:20:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:20:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:20:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:20:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-16 16:20:54,587 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 126 [2024-11-16 16:20:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:20:54,588 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-16 16:20:54,588 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:20:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-16 16:20:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:20:54,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:20:54,592 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:20:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:20:54,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:20:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:20:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 636064173, now seen corresponding path program 1 times [2024-11-16 16:20:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:20:54,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960541261] [2024-11-16 16:20:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:20:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:20:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:20:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:20:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:20:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:20:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:20:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:20:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:20:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:20:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:20:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:20:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:20:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:20:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:20:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:20:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:20:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:20:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:20:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:20:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:20:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:20:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-16 16:20:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:20:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960541261] [2024-11-16 16:20:55,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960541261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:20:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408091031] [2024-11-16 16:20:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:20:55,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:20:55,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:20:55,596 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-16 16:20:55,598 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-16 16:20:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:20:55,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 16:20:55,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:20:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 272 proven. 96 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-16 16:20:56,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:20:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 16:20:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408091031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:20:56,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 16:20:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2024-11-16 16:20:56,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983961198] [2024-11-16 16:20:56,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 16:20:56,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 16:20:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:20:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 16:20:56,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-16 16:20:56,941 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (55), 4 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-16 16:20:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:20:57,405 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2024-11-16 16:20:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 16:20:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (55), 4 states have call predecessors, (55), 5 states have call successors, (55) Word has length 126 [2024-11-16 16:20:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:20:57,409 INFO L225 Difference]: With dead ends: 117 [2024-11-16 16:20:57,409 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 16:20:57,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2024-11-16 16:20:57,411 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:20:57,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 229 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:20:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 16:20:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-16 16:20:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:20:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-11-16 16:20:57,428 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 126 [2024-11-16 16:20:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:20:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-11-16 16:20:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (55), 4 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-16 16:20:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-16 16:20:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:20:57,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:20:57,432 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:20:57,450 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-16 16:20:57,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:20:57,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:20:57,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:20:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1916092788, now seen corresponding path program 1 times [2024-11-16 16:20:57,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:20:57,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520672636] [2024-11-16 16:20:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:20:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:20:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:20:57,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:20:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:20:57,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:20:57,814 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:20:57,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:20:57,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:20:57,819 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 16:20:57,907 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:20:57,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:20:57 BoogieIcfgContainer [2024-11-16 16:20:57,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:20:57,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:20:57,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:20:57,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:20:57,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:20:53" (3/4) ... [2024-11-16 16:20:57,916 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:20:57,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:20:57,918 INFO L158 Benchmark]: Toolchain (without parser) took 5102.56ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 104.5MB in the beginning and 124.9MB in the end (delta: -20.4MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-16 16:20:57,920 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:20:57,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.21ms. Allocated memory is still 174.1MB. Free memory was 104.2MB in the beginning and 89.7MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 16:20:57,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.15ms. Allocated memory is still 174.1MB. Free memory was 89.4MB in the beginning and 86.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:20:57,921 INFO L158 Benchmark]: Boogie Preprocessor took 61.65ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 82.8MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:20:57,921 INFO L158 Benchmark]: IcfgBuilder took 504.54ms. Allocated memory is still 174.1MB. Free memory was 82.6MB in the beginning and 64.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 16:20:57,922 INFO L158 Benchmark]: TraceAbstraction took 4070.91ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 63.7MB in the beginning and 124.9MB in the end (delta: -61.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:20:57,922 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 228.6MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:20:57,928 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.19ms. Allocated memory is still 117.4MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.21ms. Allocated memory is still 174.1MB. Free memory was 104.2MB in the beginning and 89.7MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.15ms. Allocated memory is still 174.1MB. Free memory was 89.4MB in the beginning and 86.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.65ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 82.8MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 504.54ms. Allocated memory is still 174.1MB. Free memory was 82.6MB in the beginning and 64.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4070.91ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 63.7MB in the beginning and 124.9MB in the end (delta: -61.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 228.6MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L98] isInitial = 1 [L99] FCALL initially() [L100] int k_loop; [L101] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L101] COND TRUE k_loop < 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_ushort() [L59] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L59] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L61] var_1_3 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L62] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L65] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] var_1_6 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] var_1_8 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L71] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L73] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L75] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L76] var_1_11 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L77] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L81] var_1_14 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L82] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L84] var_1_15 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L87] var_1_16 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L88] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L103] RET updateVariables() [L104] CALL step() [L41] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L42] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-32769, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L43] COND FALSE !(stepLocal_0 > var_1_2) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L46] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L47] COND TRUE ! var_1_13 [L48] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L104] RET step() [L105] CALL, EXPR property() [L94-L95] return (((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3)))) ; VAL [\result=0, isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L19] reach_error() VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 131 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 2108 SizeOfPredicates, 3 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2749/3040 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-16 16:20:57,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.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 e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:21:00,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:21:00,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:21:00,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:21:00,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:21:00,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:21:00,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:21:00,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:21:00,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:21:00,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:21:00,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:21:00,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:21:00,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:21:00,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:21:00,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:21:00,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:21:00,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:21:00,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:21:00,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:21:00,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:21:00,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:21:00,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:21:00,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:21:00,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:21:00,286 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:21:00,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:21:00,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:21:00,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:21:00,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:21:00,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:21:00,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:21:00,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:21:00,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:21:00,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:21:00,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:21:00,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:21:00,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:21:00,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:21:00,291 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:21:00,291 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:21:00,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:21:00,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:21:00,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:21:00,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:21:00,293 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 -> e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d [2024-11-16 16:21:00,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:21:00,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:21:00,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:21:00,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:21:00,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:21:00,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2024-11-16 16:21:02,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:21:02,433 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:21:02,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2024-11-16 16:21:02,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132007c61/d16b28d0ee224c0f8829853ad5069deb/FLAG76721bb1a [2024-11-16 16:21:02,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132007c61/d16b28d0ee224c0f8829853ad5069deb [2024-11-16 16:21:02,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:21:02,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:21:02,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:21:02,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:21:02,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:21:02,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688c7690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02, skipping insertion in model container [2024-11-16 16:21:02,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:21:02,693 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-38.i[915,928] [2024-11-16 16:21:02,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:21:02,796 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:21:02,809 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-38.i[915,928] [2024-11-16 16:21:02,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:21:02,862 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:21:02,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02 WrapperNode [2024-11-16 16:21:02,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:21:02,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:21:02,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:21:02,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:21:02,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,921 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 16:21:02,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:21:02,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:21:02,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:21:02,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:21:02,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,955 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-16 16:21:02,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:21:02,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:21:02,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:21:02,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:21:02,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (1/1) ... [2024-11-16 16:21:02,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:21:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:21:03,023 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-16 16:21:03,027 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-16 16:21:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:21:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:21:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:21:03,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:21:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:21:03,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:21:03,147 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:21:03,150 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:21:06,518 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-16 16:21:06,518 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:21:06,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:21:06,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:21:06,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:21:06 BoogieIcfgContainer [2024-11-16 16:21:06,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:21:06,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:21:06,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:21:06,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:21:06,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:21:02" (1/3) ... [2024-11-16 16:21:06,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f6b9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:21:06, skipping insertion in model container [2024-11-16 16:21:06,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:21:02" (2/3) ... [2024-11-16 16:21:06,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f6b9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:21:06, skipping insertion in model container [2024-11-16 16:21:06,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:21:06" (3/3) ... [2024-11-16 16:21:06,546 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-38.i [2024-11-16 16:21:06,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:21:06,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:21:06,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:21:06,672 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;@6df7d691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:21:06,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:21:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:21:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:21:06,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:21:06,687 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:21:06,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:21:06,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:21:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1915177393, now seen corresponding path program 1 times [2024-11-16 16:21:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:21:06,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970938753] [2024-11-16 16:21:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:21:06,708 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-16 16:21:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:21:06,714 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-16 16:21:06,716 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-16 16:21:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:21:07,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:21:07,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:21:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-16 16:21:07,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:21:07,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:21:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970938753] [2024-11-16 16:21:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970938753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:21:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:21:07,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:21:07,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030466232] [2024-11-16 16:21:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:21:07,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:21:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:21:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:21:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:21:07,185 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:21:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:21:07,217 INFO L93 Difference]: Finished difference Result 112 states and 182 transitions. [2024-11-16 16:21:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:21:07,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-16 16:21:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:21:07,228 INFO L225 Difference]: With dead ends: 112 [2024-11-16 16:21:07,228 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:21:07,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-16 16:21:07,235 INFO L432 NwaCegarLoop]: 79 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, 79 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-16 16:21:07,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:21:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:21:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:21:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:21:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-16 16:21:07,276 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 126 [2024-11-16 16:21:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:21:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-16 16:21:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:21:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-16 16:21:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:21:07,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:21:07,281 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:21:07,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 16:21:07,481 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-16 16:21:07,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:21:07,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:21:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 636064173, now seen corresponding path program 1 times [2024-11-16 16:21:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:21:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917309099] [2024-11-16 16:21:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:21:07,485 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-16 16:21:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:21:07,486 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-16 16:21:07,489 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-16 16:21:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:21:08,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-16 16:21:08,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:21:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 231 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-16 16:21:40,980 INFO L311 TraceCheckSpWp]: Computing backward predicates...