./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.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 cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:51:02,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:51:02,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:51:02,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:51:02,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:51:02,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:51:02,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:51:02,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:51:02,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:51:02,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:51:02,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:51:02,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:51:02,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:51:02,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:51:02,270 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:51:02,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:51:02,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:51:02,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:51:02,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:51:02,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:51:02,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:51:02,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:51:02,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:51:02,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:51:02,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:51:02,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:51:02,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:51:02,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:51:02,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:51:02,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:51:02,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:51:02,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:51:02,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:02,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:51:02,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:51:02,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:51:02,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:51:02,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:51:02,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:51:02,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:51:02,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:51:02,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:51:02,277 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 -> cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 [2024-11-09 00:51:02,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:51:02,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:51:02,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:51:02,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:51:02,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:51:02,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-09 00:51:03,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:51:03,885 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:51:03,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-09 00:51:03,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9d1ec7e/7bcd64e71ed24c4a8d71a90750ed7777/FLAG98376738e [2024-11-09 00:51:03,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9d1ec7e/7bcd64e71ed24c4a8d71a90750ed7777 [2024-11-09 00:51:03,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:51:03,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:51:03,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:03,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:51:03,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:51:03,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:03" (1/1) ... [2024-11-09 00:51:03,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f606d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:03, skipping insertion in model container [2024-11-09 00:51:03,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:03" (1/1) ... [2024-11-09 00:51:03,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:51:04,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-09 00:51:04,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:04,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:51:04,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-09 00:51:04,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:04,195 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:51:04,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04 WrapperNode [2024-11-09 00:51:04,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:04,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:04,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:51:04,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:51:04,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,237 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-09 00:51:04,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:04,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:51:04,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:51:04,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:51:04,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:51:04,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:51:04,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:51:04,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:51:04,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:51:04,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (1/1) ... [2024-11-09 00:51:04,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:04,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:51:04,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:51:04,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:51:04,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:51:04,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:51:04,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:51:04,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:51:04,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:51:04,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:51:04,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:51:04,584 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 00:51:04,584 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:51:04,596 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:51:04,596 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:51:04,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:04 BoogieIcfgContainer [2024-11-09 00:51:04,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:51:04,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:51:04,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:51:04,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:51:04,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:51:03" (1/3) ... [2024-11-09 00:51:04,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7567a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:04, skipping insertion in model container [2024-11-09 00:51:04,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:04" (2/3) ... [2024-11-09 00:51:04,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7567a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:04, skipping insertion in model container [2024-11-09 00:51:04,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:04" (3/3) ... [2024-11-09 00:51:04,605 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-54.i [2024-11-09 00:51:04,617 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:51:04,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:51:04,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:51:04,663 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;@3c0f664b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:51:04,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:51:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:51:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:51:04,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:04,673 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:51:04,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:04,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 345523466, now seen corresponding path program 1 times [2024-11-09 00:51:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:04,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467283138] [2024-11-09 00:51:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:51:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:51:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:51:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:51:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:51:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:51:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:51:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:51:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:51:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:51:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:51:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 00:51:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:51:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467283138] [2024-11-09 00:51:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467283138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:51:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484148873] [2024-11-09 00:51:04,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:04,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:51:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:51:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:51:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:04,945 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:51:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:04,963 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-09 00:51:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:51:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-09 00:51:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:04,971 INFO L225 Difference]: With dead ends: 77 [2024-11-09 00:51:04,971 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 00:51:04,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:04,978 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:04,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 00:51:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 00:51:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:51:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-09 00:51:05,006 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 75 [2024-11-09 00:51:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:05,006 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-09 00:51:05,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:51:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-09 00:51:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:51:05,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:05,009 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:51:05,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:51:05,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -812801714, now seen corresponding path program 1 times [2024-11-09 00:51:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837489527] [2024-11-09 00:51:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:51:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:51:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:51:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:51:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:51:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:51:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:51:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:51:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:51:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:51:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:51:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 00:51:05,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:51:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837489527] [2024-11-09 00:51:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837489527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:05,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:51:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353905853] [2024-11-09 00:51:05,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:05,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:51:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:51:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:51:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:51:05,322 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:51:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:05,364 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-09 00:51:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:51:05,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2024-11-09 00:51:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:05,366 INFO L225 Difference]: With dead ends: 75 [2024-11-09 00:51:05,366 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 00:51:05,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:51:05,367 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:05,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 00:51:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 00:51:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:51:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-09 00:51:05,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 75 [2024-11-09 00:51:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:05,374 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-09 00:51:05,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:51:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-09 00:51:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:51:05,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:05,376 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:51:05,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:51:05,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 962205648, now seen corresponding path program 1 times [2024-11-09 00:51:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173827948] [2024-11-09 00:51:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:05,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:51:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:05,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:51:05,543 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:51:05,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:51:05,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:51:05,548 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:51:05,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:51:05,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:51:05 BoogieIcfgContainer [2024-11-09 00:51:05,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:51:05,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:51:05,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:51:05,609 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:51:05,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:04" (3/4) ... [2024-11-09 00:51:05,611 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:51:05,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:51:05,613 INFO L158 Benchmark]: Toolchain (without parser) took 1709.02ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 75.4MB in the beginning and 105.9MB in the end (delta: -30.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,613 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:05,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.83ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 75.1MB in the beginning and 161.4MB in the end (delta: -86.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.07ms. Allocated memory is still 188.7MB. Free memory was 161.4MB in the beginning and 158.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,614 INFO L158 Benchmark]: Boogie Preprocessor took 43.98ms. Allocated memory is still 188.7MB. Free memory was 158.2MB in the beginning and 154.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,614 INFO L158 Benchmark]: RCFGBuilder took 314.82ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 137.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,614 INFO L158 Benchmark]: TraceAbstraction took 1007.90ms. Allocated memory is still 188.7MB. Free memory was 137.3MB in the beginning and 107.0MB in the end (delta: 30.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,615 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 188.7MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:51:05,619 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.15ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.83ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 75.1MB in the beginning and 161.4MB in the end (delta: -86.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.07ms. Allocated memory is still 188.7MB. Free memory was 161.4MB in the beginning and 158.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.98ms. Allocated memory is still 188.7MB. Free memory was 158.2MB in the beginning and 154.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 314.82ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 137.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1007.90ms. Allocated memory is still 188.7MB. Free memory was 137.3MB in the beginning and 107.0MB in the end (delta: 30.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 188.7MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_3 = 10; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned long int var_1_9 = 5; [L29] unsigned long int var_1_10 = 3126062476; [L30] unsigned short int var_1_13 = 10; [L31] signed long int var_1_14 = 128; [L32] float var_1_15 = 4.2; [L33] float var_1_16 = 5.1; VAL [isInitial=0, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=10, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] FCALL updateLastVariables() [L89] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L68] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L68] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L69] var_1_8 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L71] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L71] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L72] var_1_10 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L73] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L74] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L74] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L75] var_1_16 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L76] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L89] RET updateVariables() [L90] CALL step() [L37] var_1_13 = var_1_3 [L38] var_1_14 = var_1_3 [L39] var_1_15 = var_1_16 [L40] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L41] COND FALSE !(-4 >= stepLocal_0) VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L44] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_2=254, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L45] COND FALSE !(var_1_3 < stepLocal_2) VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L48] unsigned long int stepLocal_1 = 8 * var_1_9; VAL [isInitial=1, stepLocal_1=40, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L49] COND FALSE !(stepLocal_1 == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) [L56] var_1_4 = var_1_8 VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((((-4 >= var_1_13) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * var_1_9) == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) ? (var_1_6 ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_4 == ((unsigned char) var_1_8))) : (var_1_4 == ((unsigned char) var_1_8)))) && ((var_1_3 < var_1_14) ? (var_1_9 == ((unsigned long int) (((((3851651024u - var_1_3)) < ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1)))))) ? ((3851651024u - var_1_3)) : ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1))))))))) : 1)) && (var_1_13 == ((unsigned short int) var_1_3))) && (var_1_14 == ((signed long int) var_1_3))) && (var_1_15 == ((float) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483647, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 100 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:51:05,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.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 cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:51:07,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:51:07,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:51:07,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:51:07,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:51:07,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:51:07,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:51:07,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:51:07,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:51:07,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:51:07,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:51:07,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:51:07,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:51:07,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:51:07,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:51:07,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:51:07,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:51:07,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:51:07,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:51:07,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:51:07,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:51:07,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:51:07,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:51:07,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:51:07,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:51:07,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:51:07,479 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:51:07,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:51:07,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:51:07,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:51:07,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:51:07,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:51:07,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:51:07,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:51:07,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:07,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:51:07,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:51:07,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:51:07,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:51:07,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:51:07,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:51:07,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:51:07,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:51:07,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:51:07,484 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 -> cca63c3e90b93de3596db2b592e4b15f16483114c2aa2d051423728d02c52eb6 [2024-11-09 00:51:07,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:51:07,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:51:07,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:51:07,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:51:07,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:51:07,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-09 00:51:09,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:51:09,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:51:09,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i [2024-11-09 00:51:09,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0406276d4/f22c4c46afe44e8cb99014f5dab471d2/FLAG26b093d27 [2024-11-09 00:51:09,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0406276d4/f22c4c46afe44e8cb99014f5dab471d2 [2024-11-09 00:51:09,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:51:09,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:51:09,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:09,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:51:09,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:51:09,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c08eb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09, skipping insertion in model container [2024-11-09 00:51:09,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:51:09,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-09 00:51:09,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:09,455 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:51:09,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-54.i[915,928] [2024-11-09 00:51:09,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:09,506 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:51:09,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09 WrapperNode [2024-11-09 00:51:09,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:09,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:09,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:51:09,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:51:09,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,543 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-09 00:51:09,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:09,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:51:09,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:51:09,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:51:09,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,572 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:51:09,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:51:09,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:51:09,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:51:09,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:51:09,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (1/1) ... [2024-11-09 00:51:09,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:09,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:09,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:51:09,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:51:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:51:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:51:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:51:09,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:51:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:51:09,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:51:09,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:51:09,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:51:09,896 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 00:51:09,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:51:09,910 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:51:09,910 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:51:09,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:09 BoogieIcfgContainer [2024-11-09 00:51:09,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:51:09,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:51:09,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:51:09,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:51:09,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:51:09" (1/3) ... [2024-11-09 00:51:09,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3ff6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:09, skipping insertion in model container [2024-11-09 00:51:09,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:09" (2/3) ... [2024-11-09 00:51:09,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3ff6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:09, skipping insertion in model container [2024-11-09 00:51:09,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:09" (3/3) ... [2024-11-09 00:51:09,919 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-54.i [2024-11-09 00:51:09,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:51:09,933 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:51:09,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:51:10,003 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;@5b20f6c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:51:10,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:51:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:51:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:51:10,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:10,015 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:51:10,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash 345523466, now seen corresponding path program 1 times [2024-11-09 00:51:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700545907] [2024-11-09 00:51:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:10,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:51:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:10,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:51:10,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:51:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:10,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:51:10,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:51:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:51:10,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:51:10,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:51:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700545907] [2024-11-09 00:51:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700545907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:10,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:10,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:51:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845686610] [2024-11-09 00:51:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:51:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:51:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:51:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:10,254 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:51:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:10,275 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-09 00:51:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:51:10,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-09 00:51:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:10,282 INFO L225 Difference]: With dead ends: 77 [2024-11-09 00:51:10,283 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 00:51:10,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:10,290 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:10,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 00:51:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 00:51:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:51:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-09 00:51:10,328 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 75 [2024-11-09 00:51:10,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:10,328 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-09 00:51:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:51:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-09 00:51:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:51:10,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:10,332 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:51:10,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:51:10,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:51:10,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:10,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:10,538 INFO L85 PathProgramCache]: Analyzing trace with hash -812801714, now seen corresponding path program 1 times [2024-11-09 00:51:10,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:10,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843126658] [2024-11-09 00:51:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:51:10,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:10,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:51:10,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:51:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:10,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 00:51:10,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:51:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 00:51:10,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:51:10,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:51:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843126658] [2024-11-09 00:51:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843126658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:10,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:51:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328671091] [2024-11-09 00:51:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:10,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:51:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:51:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:51:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:51:10,757 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:51:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:10,800 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-09 00:51:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:51:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2024-11-09 00:51:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:10,804 INFO L225 Difference]: With dead ends: 75 [2024-11-09 00:51:10,805 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 00:51:10,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:51:10,806 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:10,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 00:51:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 00:51:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:51:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-09 00:51:10,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 75 [2024-11-09 00:51:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-09 00:51:10,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:51:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-09 00:51:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:51:10,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:10,821 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:51:10,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:51:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:51:11,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:11,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash 962205648, now seen corresponding path program 1 times [2024-11-09 00:51:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155594124] [2024-11-09 00:51:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:11,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:51:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:11,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:51:11,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:51:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:11,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 00:51:11,132 INFO L278 TraceCheckSpWp]: Computing forward predicates...