./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-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-77.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc4e5353efb7eec98f5e9fb88faecc83b8efbbe0c5abc72bcda38d24162cd765 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:20:30,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:20:30,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:20:30,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:20:30,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:20:30,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:20:30,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:20:30,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:20:30,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:20:30,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:20:30,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:20:30,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:20:30,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:20:30,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:20:30,526 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:20:30,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:20:30,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:20:30,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:20:30,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:20:30,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:20:30,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:20:30,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:20:30,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:20:30,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:20:30,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:20:30,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:20:30,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:20:30,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:20:30,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:20:30,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:20:30,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:20:30,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:20:30,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:20:30,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:20:30,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:20:30,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:20:30,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc4e5353efb7eec98f5e9fb88faecc83b8efbbe0c5abc72bcda38d24162cd765 [2024-10-13 05:20:30,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:20:30,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:20:30,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:20:30,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:20:30,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:20:30,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-77.i [2024-10-13 05:20:32,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:20:32,427 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:20:32,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-77.i [2024-10-13 05:20:32,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f105ec848/4cb60fa6c537407e88e5a776eeb637a0/FLAG7d253d39e [2024-10-13 05:20:32,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f105ec848/4cb60fa6c537407e88e5a776eeb637a0 [2024-10-13 05:20:32,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:20:32,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:20:32,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:20:32,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:20:32,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:20:32,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34057299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32, skipping insertion in model container [2024-10-13 05:20:32,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:20:32,689 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-77.i[915,928] [2024-10-13 05:20:32,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:20:32,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:20:32,750 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-77.i[915,928] [2024-10-13 05:20:32,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:20:32,788 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:20:32,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32 WrapperNode [2024-10-13 05:20:32,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:20:32,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:20:32,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:20:32,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:20:32,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,830 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-13 05:20:32,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:20:32,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:20:32,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:20:32,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:20:32,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,874 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-13 05:20:32,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:20:32,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:20:32,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:20:32,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:20:32,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (1/1) ... [2024-10-13 05:20:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:20:32,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:20:32,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:20:32,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:20:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:20:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:20:32,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:20:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:20:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:20:32,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:20:33,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:20:33,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:20:33,301 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:20:33,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:20:33,334 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:20:33,334 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:20:33,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:20:33 BoogieIcfgContainer [2024-10-13 05:20:33,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:20:33,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:20:33,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:20:33,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:20:33,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:20:32" (1/3) ... [2024-10-13 05:20:33,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b170d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:20:33, skipping insertion in model container [2024-10-13 05:20:33,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:32" (2/3) ... [2024-10-13 05:20:33,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b170d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:20:33, skipping insertion in model container [2024-10-13 05:20:33,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:20:33" (3/3) ... [2024-10-13 05:20:33,341 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-77.i [2024-10-13 05:20:33,354 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:20:33,355 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:20:33,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:20:33,427 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;@79e30fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:20:33,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:20:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:20:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:20:33,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:20:33,451 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:20:33,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:20:33,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:20:33,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1303635126, now seen corresponding path program 1 times [2024-10-13 05:20:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:20:33,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042946178] [2024-10-13 05:20:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:20:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:20:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:20:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:20:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:20:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:20:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:20:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:20:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:20:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:20:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:20:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:20:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:20:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:20:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:20:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:20:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:20:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:20:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:20:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042946178] [2024-10-13 05:20:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042946178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:20:33,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:20:33,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:20:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242648014] [2024-10-13 05:20:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:20:33,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:20:33,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:20:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:20:33,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:20:33,798 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:20:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:20:33,848 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2024-10-13 05:20:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:20:33,851 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-13 05:20:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:20:33,864 INFO L225 Difference]: With dead ends: 83 [2024-10-13 05:20:33,865 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 05:20:33,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:20:33,870 INFO L432 NwaCegarLoop]: 56 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, 56 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-13 05:20:33,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:20:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 05:20:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 05:20:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:20:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2024-10-13 05:20:33,907 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 94 [2024-10-13 05:20:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:20:33,907 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2024-10-13 05:20:33,907 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:20:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2024-10-13 05:20:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:20:33,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:20:33,910 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:20:33,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:20:33,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:20:33,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:20:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -107134480, now seen corresponding path program 1 times [2024-10-13 05:20:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:20:33,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244490930] [2024-10-13 05:20:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:20:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:20:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:20:34,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:20:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:20:34,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:20:34,174 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:20:34,175 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:20:34,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:20:34,179 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 05:20:34,226 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:20:34,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:20:34 BoogieIcfgContainer [2024-10-13 05:20:34,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:20:34,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:20:34,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:20:34,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:20:34,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:20:33" (3/4) ... [2024-10-13 05:20:34,233 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:20:34,234 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:20:34,235 INFO L158 Benchmark]: Toolchain (without parser) took 1782.20ms. Allocated memory is still 159.4MB. Free memory was 94.1MB in the beginning and 122.0MB in the end (delta: -27.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:20:34,235 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:20:34,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.20ms. Allocated memory is still 159.4MB. Free memory was 93.9MB in the beginning and 125.2MB in the end (delta: -31.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-13 05:20:34,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.73ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 122.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:20:34,236 INFO L158 Benchmark]: Boogie Preprocessor took 71.92ms. Allocated memory is still 159.4MB. Free memory was 122.5MB in the beginning and 118.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:20:34,237 INFO L158 Benchmark]: RCFGBuilder took 430.50ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 99.2MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 05:20:34,237 INFO L158 Benchmark]: TraceAbstraction took 893.94ms. Allocated memory is still 159.4MB. Free memory was 98.6MB in the beginning and 122.0MB in the end (delta: -23.5MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2024-10-13 05:20:34,237 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 159.4MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:20:34,239 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.08ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.20ms. Allocated memory is still 159.4MB. Free memory was 93.9MB in the beginning and 125.2MB in the end (delta: -31.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.73ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 122.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.92ms. Allocated memory is still 159.4MB. Free memory was 122.5MB in the beginning and 118.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 430.50ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 99.2MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 893.94ms. Allocated memory is still 159.4MB. Free memory was 98.6MB in the beginning and 122.0MB in the end (delta: -23.5MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 159.4MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] float var_1_8 = 63.8; [L28] float var_1_9 = 49.5; [L29] float var_1_10 = 31.875; [L30] float var_1_11 = 255.25; [L31] unsigned short int var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float var_1_16 = 0.8; [L35] unsigned short int var_1_17 = 64; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L61] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L63] var_1_5 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L64] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L66] var_1_6 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L67] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L69] var_1_7 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_8=319/5, var_1_9=99/2] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_8=319/5, var_1_9=99/2] [L71] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L71] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L72] var_1_9 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L75] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L77] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L82] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=319/5] [L96] RET updateVariables() [L97] CALL step() [L39] COND TRUE var_1_7 > var_1_5 [L40] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L44] var_1_16 = var_1_11 [L45] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=60877, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16352, var_1_1=50, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L46] COND TRUE var_1_8 != var_1_16 [L47] var_1_1 = (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))) VAL [isInitial=1, var_1_11=60877, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16352, var_1_1=16415, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L49] unsigned char stepLocal_1 = var_1_13; [L50] signed long int stepLocal_0 = (((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)); VAL [isInitial=1, stepLocal_0=16352, stepLocal_1=-255, var_1_11=60877, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16352, var_1_1=16415, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L51] COND FALSE !(stepLocal_1 && var_1_14) [L56] var_1_12 = 64 VAL [isInitial=1, stepLocal_0=16352, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16352, var_1_1=16415, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return (((((var_1_8 != var_1_16) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((float) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f))))) && ((var_1_13 && var_1_14) ? ((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))) < ((((32) > ((var_1_1 - var_1_7))) ? (32) : ((var_1_1 - var_1_7))))) ? (var_1_12 == ((unsigned short int) (var_1_7 + 5))) : 1) : (var_1_12 == ((unsigned short int) 64)))) && (var_1_16 == ((float) var_1_11))) && (var_1_17 == ((unsigned short int) var_1_5)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16352, var_1_1=16415, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L19] reach_error() VAL [isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16352, var_1_1=16415, var_1_4=-1071611905, var_1_5=16352, var_1_6=32735, var_1_7=16383, var_1_8=60876, var_1_9=60876] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 15, 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, 56 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, 56 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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-13 05:20:34,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-77.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc4e5353efb7eec98f5e9fb88faecc83b8efbbe0c5abc72bcda38d24162cd765 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:20:36,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:20:36,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:20:36,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:20:36,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:20:36,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:20:36,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:20:36,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:20:36,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:20:36,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:20:36,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:20:36,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:20:36,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:20:36,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:20:36,582 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:20:36,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:20:36,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:20:36,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:20:36,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:20:36,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:20:36,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:20:36,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:20:36,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:20:36,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:20:36,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:20:36,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:20:36,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:20:36,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:20:36,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:20:36,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:20:36,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:20:36,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:20:36,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:20:36,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:20:36,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:20:36,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:20:36,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:20:36,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:20:36,592 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:20:36,592 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:20:36,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:20:36,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:20:36,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:20:36,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:20:36,593 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:20:36,594 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc4e5353efb7eec98f5e9fb88faecc83b8efbbe0c5abc72bcda38d24162cd765 [2024-10-13 05:20:36,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:20:36,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:20:36,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:20:36,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:20:36,874 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:20:36,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-77.i [2024-10-13 05:20:38,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:20:38,435 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:20:38,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-77.i [2024-10-13 05:20:38,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a787b7e43/7c37d004ec4445ccaed67d62090d0ca1/FLAGec386b784 [2024-10-13 05:20:38,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a787b7e43/7c37d004ec4445ccaed67d62090d0ca1 [2024-10-13 05:20:38,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:20:38,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:20:38,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:20:38,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:20:38,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:20:38,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:20:38" (1/1) ... [2024-10-13 05:20:38,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfd7e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:38, skipping insertion in model container [2024-10-13 05:20:38,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:20:38" (1/1) ... [2024-10-13 05:20:38,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:20:39,008 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-77.i[915,928] [2024-10-13 05:20:39,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:20:39,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:20:39,073 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-77.i[915,928] [2024-10-13 05:20:39,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:20:39,119 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:20:39,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39 WrapperNode [2024-10-13 05:20:39,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:20:39,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:20:39,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:20:39,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:20:39,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,161 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-13 05:20:39,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:20:39,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:20:39,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:20:39,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:20:39,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,189 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-13 05:20:39,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:20:39,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:20:39,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:20:39,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:20:39,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (1/1) ... [2024-10-13 05:20:39,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:20:39,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:20:39,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:20:39,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:20:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:20:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:20:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:20:39,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:20:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:20:39,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:20:39,373 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:20:39,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:20:39,760 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:20:39,761 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:20:39,821 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:20:39,822 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:20:39,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:20:39 BoogieIcfgContainer [2024-10-13 05:20:39,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:20:39,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:20:39,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:20:39,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:20:39,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:20:38" (1/3) ... [2024-10-13 05:20:39,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcc1dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:20:39, skipping insertion in model container [2024-10-13 05:20:39,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:20:39" (2/3) ... [2024-10-13 05:20:39,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcc1dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:20:39, skipping insertion in model container [2024-10-13 05:20:39,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:20:39" (3/3) ... [2024-10-13 05:20:39,839 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-77.i [2024-10-13 05:20:39,874 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:20:39,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:20:39,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:20:39,936 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;@7aacb925, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:20:39,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:20:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:20:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:20:39,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:20:39,949 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:20:39,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:20:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:20:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1303635126, now seen corresponding path program 1 times [2024-10-13 05:20:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:20:39,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736096330] [2024-10-13 05:20:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:20:39,971 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-13 05:20:39,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:20:39,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:20:39,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 05:20:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:40,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:20:40,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:20:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-13 05:20:40,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:20:40,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:20:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736096330] [2024-10-13 05:20:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736096330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:20:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:20:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:20:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891284823] [2024-10-13 05:20:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:20:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:20:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:20:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:20:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:20:40,302 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:20:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:20:40,385 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2024-10-13 05:20:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:20:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-13 05:20:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:20:40,399 INFO L225 Difference]: With dead ends: 83 [2024-10-13 05:20:40,399 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 05:20:40,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-13 05:20:40,405 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:20:40,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:20:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 05:20:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 05:20:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:20:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2024-10-13 05:20:40,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 94 [2024-10-13 05:20:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:20:40,436 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2024-10-13 05:20:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:20:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2024-10-13 05:20:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:20:40,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:20:40,439 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:20:40,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:20:40,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:20:40,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:20:40,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:20:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -107134480, now seen corresponding path program 1 times [2024-10-13 05:20:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:20:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267682127] [2024-10-13 05:20:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:20:40,643 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-13 05:20:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:20:40,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:20:40,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 05:20:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:20:40,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 05:20:40,832 INFO L278 TraceCheckSpWp]: Computing forward predicates...