./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.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_operatoramount_amount25_file-59.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 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:51:27,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:51:27,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:51:27,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:51:27,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:51:27,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:51:27,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:51:27,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:51:27,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:51:27,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:51:27,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:51:27,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:51:27,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:51:27,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:51:27,086 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:51:27,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:51:27,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:51:27,087 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:51:27,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:51:27,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:51:27,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:51:27,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:51:27,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:51:27,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:51:27,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:51:27,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:51:27,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:51:27,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:51:27,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:51:27,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:51:27,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:51:27,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:51:27,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:27,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:51:27,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:51:27,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:51:27,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:51:27,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:51:27,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:51:27,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:51:27,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:51:27,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:51:27,094 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 -> 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e [2024-11-09 00:51:27,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:51:27,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:51:27,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:51:27,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:51:27,316 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:51:27,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2024-11-09 00:51:28,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:51:28,794 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:51:28,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2024-11-09 00:51:28,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5583d898e/f78507f79bda4a5886a9e1808411c8ce/FLAG28c0c94ee [2024-11-09 00:51:29,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5583d898e/f78507f79bda4a5886a9e1808411c8ce [2024-11-09 00:51:29,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:51:29,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:51:29,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:29,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:51:29,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:51:29,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a933f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29, skipping insertion in model container [2024-11-09 00:51:29,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:51:29,424 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_operatoramount_amount25_file-59.i[915,928] [2024-11-09 00:51:29,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:29,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:51:29,488 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_operatoramount_amount25_file-59.i[915,928] [2024-11-09 00:51:29,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:29,522 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:51:29,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29 WrapperNode [2024-11-09 00:51:29,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:29,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:29,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:51:29,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:51:29,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,554 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-09 00:51:29,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:29,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:51:29,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:51:29,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:51:29,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,574 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-09 00:51:29,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:51:29,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:51:29,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:51:29,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:51:29,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (1/1) ... [2024-11-09 00:51:29,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:29,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:29,616 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-09 00:51:29,618 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-09 00:51:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:51:29,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:51:29,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:51:29,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:51:29,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:51:29,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:51:29,725 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:51:29,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:51:29,942 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:51:29,942 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:51:29,952 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:51:29,952 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:51:29,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:29 BoogieIcfgContainer [2024-11-09 00:51:29,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:51:29,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:51:29,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:51:29,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:51:29,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:51:29" (1/3) ... [2024-11-09 00:51:29,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2f0a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:29, skipping insertion in model container [2024-11-09 00:51:29,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:29" (2/3) ... [2024-11-09 00:51:29,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2f0a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:29, skipping insertion in model container [2024-11-09 00:51:29,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:29" (3/3) ... [2024-11-09 00:51:29,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-59.i [2024-11-09 00:51:29,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:51:29,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:51:30,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:51:30,031 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;@188e40a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:51:30,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:51:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:51:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:51:30,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:30,048 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:30,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:30,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2068994391, now seen corresponding path program 1 times [2024-11-09 00:51:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830492111] [2024-11-09 00:51:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:51:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:51:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:51:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:51:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:51:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:51:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:51:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:51:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:51:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:51:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:51:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:51:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:51:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:51:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:51:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:51:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:51:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:51:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:51:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:51:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:51:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:51:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:51:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830492111] [2024-11-09 00:51:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830492111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:30,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:30,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:51:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848973278] [2024-11-09 00:51:30,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:30,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:51:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:51:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:51:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:30,352 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:51:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:30,380 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2024-11-09 00:51:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:51:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-09 00:51:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:30,388 INFO L225 Difference]: With dead ends: 113 [2024-11-09 00:51:30,389 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 00:51:30,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-09 00:51:30,394 INFO L432 NwaCegarLoop]: 80 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, 80 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-09 00:51:30,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 00:51:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 00:51:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:51:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-09 00:51:30,428 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 132 [2024-11-09 00:51:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:30,428 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-09 00:51:30,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:51:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-09 00:51:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:51:30,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:30,431 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:51:30,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:30,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -557139255, now seen corresponding path program 1 times [2024-11-09 00:51:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24851728] [2024-11-09 00:51:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:51:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:51:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:51:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:51:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:51:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:51:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:51:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:51:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:51:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:51:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:51:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:51:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:51:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:51:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:51:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:51:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:51:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:51:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:51:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:51:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:51:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:51:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:51:30,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24851728] [2024-11-09 00:51:30,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24851728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:30,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:30,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:51:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968251861] [2024-11-09 00:51:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:30,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:51:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:51:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:51:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:51:30,855 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:51:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:30,882 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2024-11-09 00:51:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:51:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-09 00:51:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:30,887 INFO L225 Difference]: With dead ends: 109 [2024-11-09 00:51:30,889 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 00:51:30,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-09 00:51:30,891 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:30,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 00:51:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 00:51:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:51:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-11-09 00:51:30,903 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 132 [2024-11-09 00:51:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:30,905 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-11-09 00:51:30,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:51:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-09 00:51:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:51:30,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:30,908 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:30,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:51:30,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -327008013, now seen corresponding path program 1 times [2024-11-09 00:51:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:30,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804382245] [2024-11-09 00:51:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:31,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:51:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:31,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:51:31,109 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:51:31,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:51:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:51:31,114 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:51:31,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:51:31,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:51:31 BoogieIcfgContainer [2024-11-09 00:51:31,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:51:31,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:51:31,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:51:31,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:51:31,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:29" (3/4) ... [2024-11-09 00:51:31,208 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:51:31,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:51:31,210 INFO L158 Benchmark]: Toolchain (without parser) took 2009.33ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 95.2MB in the beginning and 121.1MB in the end (delta: -25.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-11-09 00:51:31,211 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:31,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.44ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 95.0MB in the beginning and 207.2MB in the end (delta: -112.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-09 00:51:31,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.20ms. Allocated memory is still 241.2MB. Free memory was 207.2MB in the beginning and 205.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:51:31,212 INFO L158 Benchmark]: Boogie Preprocessor took 29.33ms. Allocated memory is still 241.2MB. Free memory was 205.2MB in the beginning and 203.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:51:31,215 INFO L158 Benchmark]: RCFGBuilder took 369.03ms. Allocated memory is still 241.2MB. Free memory was 203.1MB in the beginning and 185.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:51:31,215 INFO L158 Benchmark]: TraceAbstraction took 1248.91ms. Allocated memory is still 241.2MB. Free memory was 185.2MB in the beginning and 121.6MB in the end (delta: 63.6MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-11-09 00:51:31,215 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 241.2MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:31,216 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.14ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.44ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 95.0MB in the beginning and 207.2MB in the end (delta: -112.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.20ms. Allocated memory is still 241.2MB. Free memory was 207.2MB in the beginning and 205.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.33ms. Allocated memory is still 241.2MB. Free memory was 205.2MB in the beginning and 203.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.03ms. Allocated memory is still 241.2MB. Free memory was 203.1MB in the beginning and 185.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1248.91ms. Allocated memory is still 241.2MB. Free memory was 185.2MB in the beginning and 121.6MB in the end (delta: 63.6MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 241.2MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] signed long int var_1_4 = -32; [L24] signed long int var_1_5 = 10; [L25] signed long int var_1_6 = -1; [L26] unsigned long int var_1_7 = 25; [L27] unsigned char var_1_8 = 1; [L28] unsigned long int var_1_9 = 2; [L29] unsigned long int var_1_10 = 32; [L30] unsigned long int var_1_11 = 128; [L31] float var_1_12 = 24.2; [L32] double var_1_13 = 999999999999999.2; [L33] double var_1_14 = 9999999.6; [L34] double var_1_15 = 9.75; [L35] float var_1_16 = 999999999999999.4; [L36] float var_1_17 = 256.6; [L37] float var_1_18 = 8.875; [L38] float var_1_19 = 256.25; [L39] signed long int last_1_var_1_1 = -128; [L40] unsigned long int last_1_var_1_7 = 25; VAL [isInitial=0, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_4 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_4 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] CALL assume_abort_if_not(var_1_4 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] RET assume_abort_if_not(var_1_4 <= 536870912) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L73] var_1_5 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L76] var_1_6 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_6 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_6 >= -1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=1, var_1_9=2] [L78] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=1, var_1_9=2] [L79] var_1_8 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_9=2] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_9=2] [L81] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=2] [L81] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=2] [L82] var_1_9 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L84] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L85] var_1_10 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L87] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L87] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L88] var_1_11 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L89] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L90] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L90] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L97] var_1_16 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L98] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L99] var_1_17 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L100] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L101] var_1_18 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L102] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L103] var_1_19 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L104] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-128, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L119] RET updateVariables() [L120] CALL step() [L44] COND TRUE ((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1) [L45] var_1_1 = ((var_1_4 + var_1_5) + var_1_6) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=25, var_1_8=0, var_1_9=4294967294] [L49] COND FALSE !(\read(var_1_8)) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] [L58] unsigned long int stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, stepLocal_0=4294967293, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] [L59] COND TRUE var_1_7 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=121/5, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] [L60] COND TRUE (var_1_13 - var_1_14) == var_1_15 [L61] var_1_12 = ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return (((((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)) ? (var_1_1 == ((signed long int) ((var_1_4 + var_1_5) + var_1_6))) : (var_1_1 == ((signed long int) var_1_6))) && (var_1_8 ? ((var_1_1 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_9) > (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (var_1_9) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_7 == ((unsigned long int) var_1_10))) : (var_1_7 == ((unsigned long int) var_1_11)))) && ((var_1_7 <= var_1_7) ? (((var_1_13 - var_1_14) == var_1_15) ? (var_1_12 == ((float) ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))))) : (var_1_12 == ((float) var_1_19))) : (var_1_12 == ((float) var_1_16))) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=4294967294, var_1_11=4294967293, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=-1073741822, var_1_4=-536870910, var_1_5=536870911, var_1_6=-1073741823, var_1_7=4294967293, var_1_8=0, var_1_9=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 158 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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-09 00:51:31,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_operatoramount_amount25_file-59.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 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:51:33,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:51:33,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:51:33,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:51:33,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:51:33,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:51:33,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:51:33,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:51:33,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:51:33,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:51:33,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:51:33,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:51:33,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:51:33,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:51:33,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:51:33,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:51:33,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:51:33,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:51:33,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:51:33,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:51:33,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:51:33,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:51:33,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:51:33,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:51:33,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:51:33,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:51:33,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:51:33,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:51:33,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:51:33,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:51:33,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:51:33,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:51:33,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:51:33,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:51:33,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:33,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:51:33,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:51:33,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:51:33,393 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:51:33,393 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:51:33,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:51:33,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:51:33,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:51:33,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:51:33,394 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 -> 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e [2024-11-09 00:51:33,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:51:33,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:51:33,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:51:33,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:51:33,623 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:51:33,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2024-11-09 00:51:34,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:51:35,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:51:35,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2024-11-09 00:51:35,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31148b3b9/9799b695dcb54b8e86c80b3691d403dc/FLAGeb762fdae [2024-11-09 00:51:35,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31148b3b9/9799b695dcb54b8e86c80b3691d403dc [2024-11-09 00:51:35,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:51:35,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:51:35,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:35,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:51:35,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:51:35,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1374679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35, skipping insertion in model container [2024-11-09 00:51:35,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:51:35,405 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_operatoramount_amount25_file-59.i[915,928] [2024-11-09 00:51:35,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:35,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:51:35,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2024-11-09 00:51:35,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:35,556 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:51:35,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35 WrapperNode [2024-11-09 00:51:35,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:35,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:35,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:51:35,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:51:35,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,596 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-09 00:51:35,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:35,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:51:35,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:51:35,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:51:35,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,625 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-09 00:51:35,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:51:35,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:51:35,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:51:35,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:51:35,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (1/1) ... [2024-11-09 00:51:35,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:35,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:35,685 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-09 00:51:35,693 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-09 00:51:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:51:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:51:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:51:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:51:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:51:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:51:35,804 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:51:35,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:51:37,066 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:51:37,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:51:37,080 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:51:37,081 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:51:37,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:37 BoogieIcfgContainer [2024-11-09 00:51:37,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:51:37,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:51:37,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:51:37,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:51:37,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:51:35" (1/3) ... [2024-11-09 00:51:37,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c943f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:37, skipping insertion in model container [2024-11-09 00:51:37,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:35" (2/3) ... [2024-11-09 00:51:37,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c943f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:37, skipping insertion in model container [2024-11-09 00:51:37,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:37" (3/3) ... [2024-11-09 00:51:37,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-59.i [2024-11-09 00:51:37,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:51:37,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:51:37,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:51:37,164 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;@fcb8833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:51:37,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:51:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:51:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:51:37,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:37,180 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:37,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2068994391, now seen corresponding path program 1 times [2024-11-09 00:51:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212195272] [2024-11-09 00:51:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:37,201 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-09 00:51:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:37,204 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-09 00:51:37,206 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-09 00:51:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:37,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:51:37,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:51:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-09 00:51:37,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:51:37,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:51:37,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212195272] [2024-11-09 00:51:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212195272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:51:37,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723767332] [2024-11-09 00:51:37,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:37,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:51:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:51:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:51:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:37,602 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:51:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:37,629 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2024-11-09 00:51:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:51:37,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-09 00:51:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:37,637 INFO L225 Difference]: With dead ends: 113 [2024-11-09 00:51:37,637 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 00:51:37,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-09 00:51:37,642 INFO L432 NwaCegarLoop]: 80 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, 80 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-09 00:51:37,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 00:51:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 00:51:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:51:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-09 00:51:37,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 132 [2024-11-09 00:51:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:37,685 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-09 00:51:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:51:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-09 00:51:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:51:37,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:37,688 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:37,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:51:37,892 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-09 00:51:37,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -557139255, now seen corresponding path program 1 times [2024-11-09 00:51:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209018861] [2024-11-09 00:51:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:37,895 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-09 00:51:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:37,898 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-09 00:51:37,899 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-09 00:51:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:38,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:51:38,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:51:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:51:38,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:51:38,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:51:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209018861] [2024-11-09 00:51:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209018861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:38,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:51:38,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640320099] [2024-11-09 00:51:38,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:51:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:51:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:51:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:51:38,211 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:51:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:38,723 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2024-11-09 00:51:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:51:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-09 00:51:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:38,737 INFO L225 Difference]: With dead ends: 109 [2024-11-09 00:51:38,737 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 00:51:38,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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-09 00:51:38,739 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:38,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:51:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 00:51:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 00:51:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:51:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-11-09 00:51:38,754 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 132 [2024-11-09 00:51:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-11-09 00:51:38,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:51:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-09 00:51:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:51:38,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:38,759 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:38,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:51:38,963 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-09 00:51:38,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:38,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash -327008013, now seen corresponding path program 1 times [2024-11-09 00:51:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:38,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231365573] [2024-11-09 00:51:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:38,968 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-09 00:51:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:38,970 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-09 00:51:38,970 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-09 00:51:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:39,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 00:51:39,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:52:28,522 WARN L286 SmtUtils]: Spent 10.64s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)