./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 516e41cc6fd3eaeda77d9f94b26b6793ff0b98fef7bf47af60e7f09fa6995d00 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:35:57,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:35:58,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:35:58,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:35:58,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:35:58,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:35:58,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:35:58,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:35:58,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:35:58,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:35:58,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:35:58,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:35:58,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:35:58,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:35:58,093 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:35:58,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:35:58,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:35:58,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:35:58,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:35:58,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:35:58,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:35:58,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:35:58,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:35:58,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:35:58,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:35:58,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:35:58,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:35:58,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:35:58,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:35:58,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:35:58,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:35:58,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:35:58,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:35:58,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:35:58,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:35:58,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:35:58,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:35:58,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:35:58,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:35:58,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:35:58,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:35:58,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:35:58,103 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-clean/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-clean/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 -> 516e41cc6fd3eaeda77d9f94b26b6793ff0b98fef7bf47af60e7f09fa6995d00 [2024-10-11 12:35:58,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:35:58,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:35:58,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:35:58,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:35:58,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:35:58,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i [2024-10-11 12:35:59,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:35:59,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:35:59,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i [2024-10-11 12:35:59,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f2780f26f/813e3c74fae144bd9333d41c7aa5bf65/FLAGbbc8e2879 [2024-10-11 12:36:00,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f2780f26f/813e3c74fae144bd9333d41c7aa5bf65 [2024-10-11 12:36:00,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:36:00,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:36:00,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:00,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:36:00,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:36:00,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9f7fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00, skipping insertion in model container [2024-10-11 12:36:00,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:36:00,387 WARN L248 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-49.i[915,928] [2024-10-11 12:36:00,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:00,462 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:36:00,473 WARN L248 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-49.i[915,928] [2024-10-11 12:36:00,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:00,513 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:36:00,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00 WrapperNode [2024-10-11 12:36:00,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:00,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:00,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:36:00,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:36:00,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,555 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-10-11 12:36:00,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:00,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:36:00,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:36:00,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:36:00,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,589 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-10-11 12:36:00,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:36:00,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:36:00,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:36:00,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:36:00,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (1/1) ... [2024-10-11 12:36:00,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:00,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:36:00,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:36:00,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:36:00,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:36:00,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:36:00,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:36:00,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:36:00,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:36:00,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:36:00,765 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:36:00,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:36:00,983 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:36:00,984 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:36:01,007 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:36:01,007 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:36:01,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:01 BoogieIcfgContainer [2024-10-11 12:36:01,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:36:01,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:36:01,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:36:01,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:36:01,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:36:00" (1/3) ... [2024-10-11 12:36:01,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d27a5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:01, skipping insertion in model container [2024-10-11 12:36:01,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:00" (2/3) ... [2024-10-11 12:36:01,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d27a5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:01, skipping insertion in model container [2024-10-11 12:36:01,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:01" (3/3) ... [2024-10-11 12:36:01,019 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-49.i [2024-10-11 12:36:01,033 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:36:01,034 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:36:01,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:36:01,123 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;@664b1d2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:36:01,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:36:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 12:36:01,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:01,142 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:36:01,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:01,147 INFO L85 PathProgramCache]: Analyzing trace with hash -539691338, now seen corresponding path program 1 times [2024-10-11 12:36:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:36:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944647451] [2024-10-11 12:36:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:36:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:36:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:36:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:36:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:36:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:36:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:36:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:36:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:36:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:36:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:36:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:36:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:36:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:36:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:36:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:36:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:36:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:36:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:36:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944647451] [2024-10-11 12:36:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944647451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:36:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:36:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:36:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099395738] [2024-10-11 12:36:01,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:36:01,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:36:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:36:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:36:01,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:36:01,489 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:36:01,524 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-10-11 12:36:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:36:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-11 12:36:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:36:01,533 INFO L225 Difference]: With dead ends: 97 [2024-10-11 12:36:01,533 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 12:36:01,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10-11 12:36:01,538 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:36:01,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:36:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 12:36:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 12:36:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-10-11 12:36:01,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 100 [2024-10-11 12:36:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:36:01,577 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-10-11 12:36:01,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-10-11 12:36:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 12:36:01,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:01,581 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:36:01,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:36:01,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:01,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 274916850, now seen corresponding path program 1 times [2024-10-11 12:36:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:36:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845744472] [2024-10-11 12:36:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:36:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:36:01,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:36:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:36:01,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:36:01,825 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:36:01,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:36:01,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:36:01,832 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:36:01,894 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:36:01,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:36:01 BoogieIcfgContainer [2024-10-11 12:36:01,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:36:01,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:36:01,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:36:01,899 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:36:01,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:01" (3/4) ... [2024-10-11 12:36:01,901 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:36:01,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:36:01,902 INFO L158 Benchmark]: Toolchain (without parser) took 1685.46ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 112.9MB in the beginning and 161.5MB in the end (delta: -48.7MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-10-11 12:36:01,902 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:36:01,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.98ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 98.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:36:01,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 94.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:36:01,903 INFO L158 Benchmark]: Boogie Preprocessor took 53.49ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 86.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 12:36:01,904 INFO L158 Benchmark]: RCFGBuilder took 397.05ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 65.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 12:36:01,904 INFO L158 Benchmark]: TraceAbstraction took 888.70ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 65.0MB in the beginning and 162.6MB in the end (delta: -97.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:36:01,904 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 245.4MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:36:01,906 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 is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.98ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 98.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 94.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.49ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 86.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 397.05ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 65.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 888.70ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 65.0MB in the beginning and 162.6MB in the end (delta: -97.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 245.4MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] float var_1_2 = 1000000000000000.4; [L24] float var_1_3 = 1000.2; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] signed char var_1_15 = -1; [L35] signed char var_1_16 = 0; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L63] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L64] var_1_3 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L65] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L66] var_1_4 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128] [L68] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128] [L68] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128] [L69] var_1_5 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128] [L71] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=10, var_1_8=128] [L71] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=10, var_1_8=128] [L72] var_1_6 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_8=128] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_8=128] [L74] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L74] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L76] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L77] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L77] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L78] var_1_12 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L80] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L80] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L82] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L84] var_1_16 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L85] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L86] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L86] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L99] RET updateVariables() [L100] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L41] COND FALSE !(var_1_2 >= 64.5f) [L52] var_1_1 = 50 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=128] [L54] var_1_8 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=126] [L55] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=126] [L55] COND TRUE (50 >> var_1_4) <= var_1_8 [L56] var_1_10 = ((! (! var_1_11)) || var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=126] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=126] [L91-L92] return (((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=126] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 16, 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, 67 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 67 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 480/480 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-10-11 12:36:01,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 516e41cc6fd3eaeda77d9f94b26b6793ff0b98fef7bf47af60e7f09fa6995d00 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:36:03,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:36:03,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:36:03,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:36:03,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:36:03,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:36:03,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:36:03,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:36:03,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:36:03,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:36:03,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:36:03,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:36:03,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:36:03,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:36:03,920 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:36:03,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:36:03,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:36:03,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:36:03,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:36:03,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:36:03,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:36:03,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:36:03,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:36:03,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:36:03,923 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:36:03,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:36:03,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:36:03,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:36:03,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:36:03,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:36:03,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:36:03,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:36:03,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:36:03,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:36:03,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:03,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:36:03,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:36:03,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:36:03,926 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:36:03,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:36:03,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:36:03,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:36:03,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:36:03,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:36:03,929 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:36:03,929 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-clean/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-clean/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 -> 516e41cc6fd3eaeda77d9f94b26b6793ff0b98fef7bf47af60e7f09fa6995d00 [2024-10-11 12:36:04,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:36:04,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:36:04,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:36:04,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:36:04,241 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:36:04,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i [2024-10-11 12:36:05,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:36:05,751 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:36:05,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-49.i [2024-10-11 12:36:05,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f33b56f4/e05130999381453db0cdea99b89efc22/FLAG1f8692b3d [2024-10-11 12:36:06,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f33b56f4/e05130999381453db0cdea99b89efc22 [2024-10-11 12:36:06,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:36:06,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:36:06,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:06,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:36:06,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:36:06,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e99512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06, skipping insertion in model container [2024-10-11 12:36:06,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:36:06,306 WARN L248 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-49.i[915,928] [2024-10-11 12:36:06,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:06,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:36:06,381 WARN L248 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-49.i[915,928] [2024-10-11 12:36:06,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:06,415 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:36:06,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06 WrapperNode [2024-10-11 12:36:06,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:06,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:06,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:36:06,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:36:06,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,461 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-10-11 12:36:06,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:06,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:36:06,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:36:06,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:36:06,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,499 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-10-11 12:36:06,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:36:06,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:36:06,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:36:06,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:36:06,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (1/1) ... [2024-10-11 12:36:06,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:06,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:36:06,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:36:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:36:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:36:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:36:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:36:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:36:06,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:36:06,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:36:06,676 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:36:06,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:36:06,861 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:36:06,861 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:36:06,903 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:36:06,904 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:36:06,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:06 BoogieIcfgContainer [2024-10-11 12:36:06,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:36:06,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:36:06,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:36:06,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:36:06,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:36:06" (1/3) ... [2024-10-11 12:36:06,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6e630a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:06, skipping insertion in model container [2024-10-11 12:36:06,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:06" (2/3) ... [2024-10-11 12:36:06,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6e630a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:06, skipping insertion in model container [2024-10-11 12:36:06,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:06" (3/3) ... [2024-10-11 12:36:06,911 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-49.i [2024-10-11 12:36:06,925 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:36:06,925 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:36:06,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:36:06,994 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;@b817a5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:36:06,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:36:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 12:36:07,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:07,009 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:36:07,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:07,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash -314127353, now seen corresponding path program 1 times [2024-10-11 12:36:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:36:07,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7783427] [2024-10-11 12:36:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:07,028 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-10-11 12:36:07,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:36:07,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 12:36:07,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:36:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:07,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:36:07,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:36:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 12:36:07,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:36:07,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:36:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7783427] [2024-10-11 12:36:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7783427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:36:07,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:36:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:36:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160535746] [2024-10-11 12:36:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:36:07,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:36:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:36:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:36:07,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:36:07,283 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:36:07,318 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2024-10-11 12:36:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:36:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 97 [2024-10-11 12:36:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:36:07,326 INFO L225 Difference]: With dead ends: 83 [2024-10-11 12:36:07,327 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 12:36:07,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:36:07,333 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:36:07,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:36:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 12:36:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 12:36:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-11 12:36:07,371 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 97 [2024-10-11 12:36:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:36:07,372 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-11 12:36:07,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-11 12:36:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 12:36:07,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:07,375 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:36:07,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:36:07,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 12:36:07,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1822787147, now seen corresponding path program 1 times [2024-10-11 12:36:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:36:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806544968] [2024-10-11 12:36:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:07,579 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-10-11 12:36:07,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:36:07,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 12:36:07,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:36:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:07,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:36:07,728 INFO L278 TraceCheckSpWp]: Computing forward predicates...