./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.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 d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:45:09,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:45:09,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:45:09,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:45:09,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:45:09,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:45:09,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:45:09,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:45:09,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:45:09,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:45:09,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:45:09,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:45:09,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:45:09,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:45:09,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:45:09,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:45:09,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:45:09,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:45:09,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:45:09,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:45:09,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:45:09,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:45:09,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:45:09,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:45:09,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:45:09,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:45:09,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:45:09,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:45:09,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:45:09,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:45:09,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:45:09,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:45:09,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:45:09,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:45:09,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:45:09,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:45:09,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:45:09,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:45:09,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:45:09,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:45:09,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:45:09,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:45:09,147 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 -> d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 [2024-11-08 19:45:09,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:45:09,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:45:09,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:45:09,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:45:09,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:45:09,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-11-08 19:45:10,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:45:11,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:45:11,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-11-08 19:45:11,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5697919e2/4e784b0ebd284fad81cab08596c46594/FLAG91dbdf045 [2024-11-08 19:45:11,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5697919e2/4e784b0ebd284fad81cab08596c46594 [2024-11-08 19:45:11,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:45:11,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:45:11,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:45:11,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:45:11,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:45:11,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261f5494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11, skipping insertion in model container [2024-11-08 19:45:11,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:45:11,355 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_codestructure_steplocals_file-30.i[917,930] [2024-11-08 19:45:11,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:45:11,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:45:11,438 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_codestructure_steplocals_file-30.i[917,930] [2024-11-08 19:45:11,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:45:11,494 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:45:11,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11 WrapperNode [2024-11-08 19:45:11,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:45:11,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:45:11,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:45:11,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:45:11,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,555 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-11-08 19:45:11,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:45:11,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:45:11,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:45:11,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:45:11,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,590 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-08 19:45:11,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:45:11,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:45:11,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:45:11,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:45:11,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (1/1) ... [2024-11-08 19:45:11,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:45:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:45:11,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:45:11,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:45:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:45:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:45:11,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:45:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:45:11,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:45:11,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:45:11,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:45:11,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:45:12,069 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 19:45:12,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:45:12,086 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:45:12,087 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:45:12,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:12 BoogieIcfgContainer [2024-11-08 19:45:12,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:45:12,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:45:12,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:45:12,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:45:12,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:45:11" (1/3) ... [2024-11-08 19:45:12,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8e9d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:45:12, skipping insertion in model container [2024-11-08 19:45:12,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:11" (2/3) ... [2024-11-08 19:45:12,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8e9d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:45:12, skipping insertion in model container [2024-11-08 19:45:12,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:12" (3/3) ... [2024-11-08 19:45:12,098 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2024-11-08 19:45:12,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:45:12,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:45:12,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:45:12,206 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;@78718ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:45:12,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:45:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:45:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 19:45:12,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:12,229 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:12,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash 324545300, now seen corresponding path program 1 times [2024-11-08 19:45:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:45:12,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849296045] [2024-11-08 19:45:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:45:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:45:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:45:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:45:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:45:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:45:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:45:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:45:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:45:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:45:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:45:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:45:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:45:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:45:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:45:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:45:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:45:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 19:45:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 19:45:12,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:45:12,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849296045] [2024-11-08 19:45:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849296045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:45:12,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:45:12,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:45:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440315722] [2024-11-08 19:45:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:45:12,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:45:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:45:12,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:45:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:45:12,673 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:45:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:45:12,707 INFO L93 Difference]: Finished difference Result 137 states and 232 transitions. [2024-11-08 19:45:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:45:12,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2024-11-08 19:45:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:45:12,718 INFO L225 Difference]: With dead ends: 137 [2024-11-08 19:45:12,718 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 19:45:12,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-08 19:45:12,723 INFO L432 NwaCegarLoop]: 103 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, 103 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-08 19:45:12,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:45:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 19:45:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 19:45:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:45:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-08 19:45:12,762 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 122 [2024-11-08 19:45:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:45:12,762 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-08 19:45:12,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:45:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-08 19:45:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 19:45:12,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:12,767 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:12,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:45:12,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:12,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -736951392, now seen corresponding path program 1 times [2024-11-08 19:45:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:45:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246731797] [2024-11-08 19:45:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:45:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:45:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:45:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:45:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:45:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:45:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:45:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:45:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:45:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:45:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:45:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:45:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:45:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:45:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:45:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:45:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:45:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 19:45:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 19:45:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:45:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246731797] [2024-11-08 19:45:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246731797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:45:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752458056] [2024-11-08 19:45:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:45:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:45:13,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:45:13,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:45:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 19:45:13,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 19:45:13,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:45:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 19:45:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752458056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:45:14,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:45:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-08 19:45:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164547757] [2024-11-08 19:45:14,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:45:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:45:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:45:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:45:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:45:14,284 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 19:45:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:45:14,890 INFO L93 Difference]: Finished difference Result 195 states and 286 transitions. [2024-11-08 19:45:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:45:14,891 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 122 [2024-11-08 19:45:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:45:14,898 INFO L225 Difference]: With dead ends: 195 [2024-11-08 19:45:14,898 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 19:45:14,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2024-11-08 19:45:14,900 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 252 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:45:14,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 401 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:45:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 19:45:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2024-11-08 19:45:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 87 states have internal predecessors, (117), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:45:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 19:45:14,930 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 122 [2024-11-08 19:45:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:45:14,930 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 19:45:14,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 19:45:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 19:45:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 19:45:14,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:14,933 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:14,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:45:15,134 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-08 19:45:15,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -121710713, now seen corresponding path program 1 times [2024-11-08 19:45:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:45:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550503102] [2024-11-08 19:45:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:45:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:45:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:45:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:45:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:45:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:45:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:45:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:45:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:45:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:45:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:45:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:45:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:45:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:45:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:45:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:45:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:45:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 19:45:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 19:45:15,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:45:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550503102] [2024-11-08 19:45:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550503102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:45:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:45:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:45:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322934912] [2024-11-08 19:45:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:45:15,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:45:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:45:15,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:45:15,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:45:15,474 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 19:45:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:45:15,629 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2024-11-08 19:45:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:45:15,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-08 19:45:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:45:15,634 INFO L225 Difference]: With dead ends: 252 [2024-11-08 19:45:15,636 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 19:45:15,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:45:15,640 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:45:15,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 416 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:45:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 19:45:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2024-11-08 19:45:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 98 states have internal predecessors, (135), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:45:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2024-11-08 19:45:15,667 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 124 [2024-11-08 19:45:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:45:15,669 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 179 transitions. [2024-11-08 19:45:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 19:45:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 179 transitions. [2024-11-08 19:45:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 19:45:15,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:15,674 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:15,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:45:15,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1710058615, now seen corresponding path program 1 times [2024-11-08 19:45:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:45:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176086567] [2024-11-08 19:45:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:45:15,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:45:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:45:15,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:45:15,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:45:15,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:45:15,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:45:15,824 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:45:15,906 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:45:15,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:45:15 BoogieIcfgContainer [2024-11-08 19:45:15,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:45:15,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:45:15,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:45:15,911 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:45:15,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:12" (3/4) ... [2024-11-08 19:45:15,917 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:45:15,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:45:15,919 INFO L158 Benchmark]: Toolchain (without parser) took 4795.82ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 105.1MB in the beginning and 181.2MB in the end (delta: -76.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:45:15,919 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:45:15,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.51ms. Allocated memory is still 161.5MB. Free memory was 105.1MB in the beginning and 89.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:45:15,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.78ms. Allocated memory is still 161.5MB. Free memory was 89.9MB in the beginning and 87.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:45:15,920 INFO L158 Benchmark]: Boogie Preprocessor took 49.34ms. Allocated memory is still 161.5MB. Free memory was 87.4MB in the beginning and 84.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:45:15,923 INFO L158 Benchmark]: RCFGBuilder took 480.79ms. Allocated memory is still 161.5MB. Free memory was 84.6MB in the beginning and 66.2MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:45:15,923 INFO L158 Benchmark]: TraceAbstraction took 3820.93ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 65.3MB in the beginning and 182.3MB in the end (delta: -117.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:45:15,923 INFO L158 Benchmark]: Witness Printer took 6.95ms. Allocated memory is still 234.9MB. Free memory was 182.3MB in the beginning and 181.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:45:15,925 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.51ms. Allocated memory is still 161.5MB. Free memory was 105.1MB in the beginning and 89.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.78ms. Allocated memory is still 161.5MB. Free memory was 89.9MB in the beginning and 87.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.34ms. Allocated memory is still 161.5MB. Free memory was 87.4MB in the beginning and 84.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 480.79ms. Allocated memory is still 161.5MB. Free memory was 84.6MB in the beginning and 66.2MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3820.93ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 65.3MB in the beginning and 182.3MB in the end (delta: -117.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.95ms. Allocated memory is still 234.9MB. Free memory was 182.3MB in the beginning and 181.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 130, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_2 = -256; [L24] signed long int var_1_3 = 256; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 127.5; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 10000000000000.125; [L29] double var_1_8 = 1.25; [L30] double var_1_9 = 4.125; [L31] double var_1_10 = 25.7; [L32] signed long int var_1_11 = -2; [L33] double var_1_12 = 49.75; [L34] signed long int var_1_13 = 5; [L35] signed long int var_1_14 = 128; [L36] signed long int var_1_15 = 1000; [L37] double var_1_16 = 0.2; [L38] double var_1_17 = 0.25; [L39] double var_1_18 = 99999999999999.5; VAL [isInitial=0, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-256, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L97] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L99] var_1_3 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L100] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L102] var_1_4 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L103] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L105] var_1_6 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L106] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L108] var_1_7 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L109] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L111] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L112] var_1_10 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L113] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L114] var_1_12 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L115] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L116] var_1_13 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L117] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L118] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L118] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L119] var_1_14 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L120] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L121] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L121] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L122] var_1_17 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L123] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L124] var_1_18 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L125] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L138] RET updateVariables() [L139] CALL step() [L43] signed long int stepLocal_0 = var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16))); VAL [isInitial=1, stepLocal_0=4, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L44] COND FALSE !(stepLocal_0 >= var_1_3) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L47] signed long int stepLocal_2 = var_1_3; [L48] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L49] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L50] COND FALSE !(var_1_2 >= stepLocal_2) [L55] var_1_5 = var_1_7 VAL [isInitial=1, stepLocal_1=0, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=5/4] [L58] COND FALSE !(10.55f < var_1_5) VAL [isInitial=1, stepLocal_1=0, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=5/4] [L63] COND TRUE var_1_5 > var_1_7 [L64] var_1_8 = var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L69] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L70] COND FALSE !(((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L76] EXPR var_1_3 & var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L76] COND FALSE !((- var_1_2) > (var_1_3 & var_1_13)) [L87] var_1_15 = var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=0, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L89] COND TRUE ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7 [L90] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR ((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L130-L131] return (((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] [L19] reach_error() VAL [isInitial=1, var_1_10=100000000000005, var_1_11=-2, var_1_13=0, var_1_14=2147483646, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000004, var_1_6=0, var_1_7=100000000000004, var_1_8=100000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 362 mSDsluCounter, 920 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 623 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 461 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 297 mSDtfsCounter, 461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 35 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 1295 SizeOfPredicates, 1 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2910/3060 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-08 19:45:15,964 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_codestructure_steplocals_file-30.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 d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:45:18,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:45:18,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:45:18,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:45:18,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:45:18,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:45:18,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:45:18,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:45:18,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:45:18,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:45:18,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:45:18,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:45:18,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:45:18,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:45:18,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:45:18,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:45:18,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:45:18,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:45:18,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:45:18,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:45:18,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:45:18,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:45:18,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:45:18,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:45:18,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:45:18,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:45:18,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:45:18,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:45:18,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:45:18,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:45:18,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:45:18,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:45:18,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:45:18,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:45:18,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:45:18,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:45:18,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:45:18,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:45:18,318 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:45:18,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:45:18,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:45:18,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:45:18,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:45:18,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:45:18,320 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 -> d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 [2024-11-08 19:45:18,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:45:18,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:45:18,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:45:18,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:45:18,683 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:45:18,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-11-08 19:45:20,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:45:20,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:45:20,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-11-08 19:45:20,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b001949c0/065454e706e64e58b4262d1b99259be1/FLAG1e69f9eb9 [2024-11-08 19:45:20,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b001949c0/065454e706e64e58b4262d1b99259be1 [2024-11-08 19:45:20,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:45:20,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:45:20,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:45:20,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:45:20,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:45:20,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160869c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20, skipping insertion in model container [2024-11-08 19:45:20,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:45:20,649 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_codestructure_steplocals_file-30.i[917,930] [2024-11-08 19:45:20,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:45:20,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:45:20,768 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_codestructure_steplocals_file-30.i[917,930] [2024-11-08 19:45:20,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:45:20,828 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:45:20,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20 WrapperNode [2024-11-08 19:45:20,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:45:20,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:45:20,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:45:20,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:45:20,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,891 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-08 19:45:20,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:45:20,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:45:20,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:45:20,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:45:20,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,927 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-08 19:45:20,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:45:20,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:45:20,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:45:20,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:45:20,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (1/1) ... [2024-11-08 19:45:20,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:45:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:45:20,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:45:20,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:45:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:45:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:45:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:45:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:45:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:45:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:45:21,130 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:45:21,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:45:30,463 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:45:30,464 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:45:30,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:45:30,486 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:45:30,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:30 BoogieIcfgContainer [2024-11-08 19:45:30,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:45:30,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:45:30,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:45:30,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:45:30,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:45:20" (1/3) ... [2024-11-08 19:45:30,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31684c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:45:30, skipping insertion in model container [2024-11-08 19:45:30,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:20" (2/3) ... [2024-11-08 19:45:30,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31684c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:45:30, skipping insertion in model container [2024-11-08 19:45:30,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:30" (3/3) ... [2024-11-08 19:45:30,494 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2024-11-08 19:45:30,512 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:45:30,512 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:45:30,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:45:30,586 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;@28403725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:45:30,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:45:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:45:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 19:45:30,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:30,602 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:30,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:30,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 443473077, now seen corresponding path program 1 times [2024-11-08 19:45:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:45:30,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253783937] [2024-11-08 19:45:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:30,618 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-08 19:45:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:45:30,621 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-08 19:45:30,623 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-08 19:45:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:31,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:45:31,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 19:45:31,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:45:31,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:45:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253783937] [2024-11-08 19:45:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253783937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:45:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:45:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:45:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610963500] [2024-11-08 19:45:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:45:31,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:45:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:45:31,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:45:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:45:31,205 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:45:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:45:31,251 INFO L93 Difference]: Finished difference Result 119 states and 204 transitions. [2024-11-08 19:45:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:45:31,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-08 19:45:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:45:31,264 INFO L225 Difference]: With dead ends: 119 [2024-11-08 19:45:31,265 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 19:45:31,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-08 19:45:31,271 INFO L432 NwaCegarLoop]: 89 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, 89 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-08 19:45:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:45:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 19:45:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 19:45:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:45:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-11-08 19:45:31,314 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 119 [2024-11-08 19:45:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:45:31,315 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-11-08 19:45:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:45:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-11-08 19:45:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 19:45:31,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:31,318 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:31,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:45:31,519 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-08 19:45:31,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:31,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1499049897, now seen corresponding path program 1 times [2024-11-08 19:45:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:45:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363097391] [2024-11-08 19:45:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:31,522 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-08 19:45:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:45:31,525 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-08 19:45:31,527 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-08 19:45:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:31,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:45:31,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 19:45:34,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:45:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 19:45:35,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:45:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363097391] [2024-11-08 19:45:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363097391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:45:35,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:45:35,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-08 19:45:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710704730] [2024-11-08 19:45:35,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:45:35,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:45:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:45:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:45:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:45:35,724 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 19:45:41,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:45:45,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:45:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:45:46,654 INFO L93 Difference]: Finished difference Result 135 states and 197 transitions. [2024-11-08 19:45:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:45:46,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 119 [2024-11-08 19:45:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:45:46,658 INFO L225 Difference]: With dead ends: 135 [2024-11-08 19:45:46,658 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 19:45:46,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:45:46,663 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 87 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:45:46,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 233 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 215 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-11-08 19:45:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 19:45:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-11-08 19:45:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:45:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-11-08 19:45:46,680 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 119 [2024-11-08 19:45:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:45:46,681 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-11-08 19:45:46,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 19:45:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-08 19:45:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 19:45:46,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:46,683 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:46,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:45:46,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:45:46,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:46,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2036560606, now seen corresponding path program 1 times [2024-11-08 19:45:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:45:46,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590660012] [2024-11-08 19:45:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:46,886 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-08 19:45:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:45:46,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:45:46,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:45:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:47,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:45:47,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 19:45:47,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:45:47,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:45:47,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590660012] [2024-11-08 19:45:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590660012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:45:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:45:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:45:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507600728] [2024-11-08 19:45:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:45:47,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:45:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:45:47,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:45:47,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:45:47,355 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 19:45:49,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:45:56,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:45:58,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:45:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:45:58,976 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2024-11-08 19:45:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:45:58,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-08 19:45:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:45:58,982 INFO L225 Difference]: With dead ends: 179 [2024-11-08 19:45:58,982 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 19:45:58,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:45:58,984 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:45:58,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 176 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2024-11-08 19:45:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 19:45:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-11-08 19:45:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.24) internal successors, (93), 77 states have internal predecessors, (93), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:45:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2024-11-08 19:45:59,010 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 153 transitions. Word has length 121 [2024-11-08 19:45:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:45:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 153 transitions. [2024-11-08 19:45:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 19:45:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2024-11-08 19:45:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 19:45:59,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:45:59,014 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:45:59,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 19:45:59,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:45:59,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:45:59,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1356502236, now seen corresponding path program 1 times [2024-11-08 19:45:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:45:59,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885416988] [2024-11-08 19:45:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:45:59,216 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-08 19:45:59,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:45:59,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:45:59,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:45:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:59,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 19:45:59,740 INFO L278 TraceCheckSpWp]: Computing forward predicates...