./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-38.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-38.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 a44b26a5377afae32910ca75d7e768b9c21cc5f85cc59743ffa555275482d07c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:49:12,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:49:12,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:49:12,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:49:12,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:49:12,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:49:12,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:49:12,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:49:12,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:49:12,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:49:12,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:49:12,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:49:12,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:49:12,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:49:12,463 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:49:12,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:49:12,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:49:12,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:49:12,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:49:12,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:49:12,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:49:12,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:49:12,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:49:12,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:49:12,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:49:12,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:49:12,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:49:12,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:49:12,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:49:12,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:49:12,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:49:12,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:49:12,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:49:12,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:49:12,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:49:12,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:49:12,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:49:12,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:49:12,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:49:12,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:49:12,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:49:12,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:49:12,475 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 -> a44b26a5377afae32910ca75d7e768b9c21cc5f85cc59743ffa555275482d07c [2024-11-09 00:49:12,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:49:12,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:49:12,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:49:12,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:49:12,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:49:12,752 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-38.i [2024-11-09 00:49:14,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:49:14,388 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:49:14,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-38.i [2024-11-09 00:49:14,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36eb4fbf6/3faafbb8764a4ade9f2c6ad2c7baa2d7/FLAG9c3e1a959 [2024-11-09 00:49:14,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36eb4fbf6/3faafbb8764a4ade9f2c6ad2c7baa2d7 [2024-11-09 00:49:14,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:49:14,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:49:14,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:49:14,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:49:14,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:49:14,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ecf44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14, skipping insertion in model container [2024-11-09 00:49:14,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:49:14,617 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-38.i[915,928] [2024-11-09 00:49:14,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:49:14,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:49:14,713 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-38.i[915,928] [2024-11-09 00:49:14,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:49:14,770 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:49:14,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14 WrapperNode [2024-11-09 00:49:14,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:49:14,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:49:14,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:49:14,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:49:14,779 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:49:14" (1/1) ... [2024-11-09 00:49:14,790 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:49:14" (1/1) ... [2024-11-09 00:49:14,831 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-09 00:49:14,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:49:14,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:49:14,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:49:14,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:49:14,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,861 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:49:14,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:49:14,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:49:14,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:49:14,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:49:14,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (1/1) ... [2024-11-09 00:49:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:49:14,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:49:14,921 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:49:14,924 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:49:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:49:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:49:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:49:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:49:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:49:14,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:49:15,069 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:49:15,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:49:15,347 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:49:15,348 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:49:15,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:49:15,364 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:49:15,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:15 BoogieIcfgContainer [2024-11-09 00:49:15,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:49:15,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:49:15,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:49:15,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:49:15,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:49:14" (1/3) ... [2024-11-09 00:49:15,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37684481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:49:15, skipping insertion in model container [2024-11-09 00:49:15,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:14" (2/3) ... [2024-11-09 00:49:15,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37684481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:49:15, skipping insertion in model container [2024-11-09 00:49:15,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:15" (3/3) ... [2024-11-09 00:49:15,375 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-38.i [2024-11-09 00:49:15,394 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:49:15,395 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:49:15,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:49:15,464 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;@e4f3e53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:49:15,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:49:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:49:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:49:15,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:15,481 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:15,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:15,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1048086186, now seen corresponding path program 1 times [2024-11-09 00:49:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968214008] [2024-11-09 00:49:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:49:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:49:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:49:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:49:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:49:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:49:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:49:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:49:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:49:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:49:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:49:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:49:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:49:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:49:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:49:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:49:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:49:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:49:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:49:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:49:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:49:15,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:49:15,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968214008] [2024-11-09 00:49:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968214008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:49:15,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:49:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:49:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361355936] [2024-11-09 00:49:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:49:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:49:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:49:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:49:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:49:15,971 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:49:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:49:16,000 INFO L93 Difference]: Finished difference Result 103 states and 174 transitions. [2024-11-09 00:49:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:49:16,003 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-09 00:49:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:49:16,011 INFO L225 Difference]: With dead ends: 103 [2024-11-09 00:49:16,012 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:49:16,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:49:16,021 INFO L432 NwaCegarLoop]: 73 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, 73 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:49:16,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:49:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:49:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:49:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:49:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-09 00:49:16,075 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124 [2024-11-09 00:49:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:49:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-09 00:49:16,076 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:49:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-09 00:49:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:49:16,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:16,080 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:49:16,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:16,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash 531958366, now seen corresponding path program 1 times [2024-11-09 00:49:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:16,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025940587] [2024-11-09 00:49:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:49:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:49:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:49:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:49:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:49:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:49:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:49:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:49:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:49:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:49:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:49:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:49:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:49:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:49:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:49:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:49:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:49:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:49:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:49:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:49:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-09 00:49:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:49:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025940587] [2024-11-09 00:49:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025940587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:49:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122537115] [2024-11-09 00:49:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:49:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:49:17,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:49:17,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:49:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:17,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:49:17,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:49:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 272 proven. 96 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-09 00:49:18,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:49:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-09 00:49:18,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122537115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:49:18,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:49:18,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 16 [2024-11-09 00:49:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900417630] [2024-11-09 00:49:18,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:49:18,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:49:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:49:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:49:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:49:18,511 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-09 00:49:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:49:18,949 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions. [2024-11-09 00:49:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 00:49:18,950 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 124 [2024-11-09 00:49:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:49:18,952 INFO L225 Difference]: With dead ends: 113 [2024-11-09 00:49:18,952 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 00:49:18,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2024-11-09 00:49:18,954 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:49:18,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:49:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 00:49:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-09 00:49:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:49:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-11-09 00:49:18,967 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 124 [2024-11-09 00:49:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:49:18,968 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-11-09 00:49:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-09 00:49:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-11-09 00:49:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:49:18,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:18,971 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:18,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:49:19,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:49:19,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:19,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1988001568, now seen corresponding path program 1 times [2024-11-09 00:49:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137194593] [2024-11-09 00:49:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:49:19,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:49:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:49:19,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:49:19,334 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:49:19,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:49:19,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:49:19,341 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:49:19,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:49:19,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:49:19 BoogieIcfgContainer [2024-11-09 00:49:19,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:49:19,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:49:19,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:49:19,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:49:19,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:15" (3/4) ... [2024-11-09 00:49:19,434 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:49:19,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:49:19,436 INFO L158 Benchmark]: Toolchain (without parser) took 5022.64ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 111.7MB in the beginning and 61.8MB in the end (delta: 49.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-11-09 00:49:19,436 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:49:19,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.17ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 96.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:49:19,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.61ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 93.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:49:19,437 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 89.4MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:49:19,437 INFO L158 Benchmark]: RCFGBuilder took 476.71ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 89.4MB in the beginning and 168.5MB in the end (delta: -79.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-09 00:49:19,438 INFO L158 Benchmark]: TraceAbstraction took 4063.23ms. Allocated memory is still 205.5MB. Free memory was 167.4MB in the beginning and 61.8MB in the end (delta: 105.6MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. [2024-11-09 00:49:19,438 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 205.5MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:49:19,443 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.24ms. Allocated memory is still 167.8MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.17ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 96.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.61ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 93.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 89.4MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 476.71ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 89.4MB in the beginning and 168.5MB in the end (delta: -79.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4063.23ms. Allocated memory is still 205.5MB. Free memory was 167.4MB in the beginning and 61.8MB in the end (delta: 105.6MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 205.5MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_ushort() [L59] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L59] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L61] var_1_3 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L62] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L65] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] var_1_6 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] var_1_8 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L71] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L73] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L75] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L76] var_1_11 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L77] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L81] var_1_14 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L82] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L84] var_1_15 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L87] var_1_16 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L88] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L42] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=32767, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L43] COND FALSE !(stepLocal_0 > var_1_2) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L46] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735] [L47] COND TRUE ! var_1_13 [L48] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return (((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3)))) ; VAL [\result=0, isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735] [L19] reach_error() VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1103822850, var_1_4=32767, var_1_5=16, var_1_6=1610612735] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 123 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 1903 SizeOfPredicates, 3 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2749/3040 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:49:19,475 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-38.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 a44b26a5377afae32910ca75d7e768b9c21cc5f85cc59743ffa555275482d07c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:49:21,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:49:21,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:49:21,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:49:21,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:49:21,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:49:21,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:49:21,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:49:21,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:49:21,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:49:21,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:49:21,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:49:21,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:49:21,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:49:21,804 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:49:21,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:49:21,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:49:21,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:49:21,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:49:21,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:49:21,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:49:21,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:49:21,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:49:21,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:49:21,810 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:49:21,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:49:21,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:49:21,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:49:21,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:49:21,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:49:21,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:49:21,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:49:21,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:49:21,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:49:21,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:49:21,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:49:21,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:49:21,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:49:21,815 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:49:21,815 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:49:21,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:49:21,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:49:21,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:49:21,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:49:21,817 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 -> a44b26a5377afae32910ca75d7e768b9c21cc5f85cc59743ffa555275482d07c [2024-11-09 00:49:22,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:49:22,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:49:22,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:49:22,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:49:22,166 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:49:22,167 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-38.i [2024-11-09 00:49:23,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:49:23,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:49:23,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-38.i [2024-11-09 00:49:23,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551e41f93/acbcb7206ba74366be0ecb05813adde0/FLAGd42e92d42 [2024-11-09 00:49:23,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551e41f93/acbcb7206ba74366be0ecb05813adde0 [2024-11-09 00:49:23,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:49:23,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:49:23,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:49:23,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:49:23,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:49:23,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:49:23" (1/1) ... [2024-11-09 00:49:23,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732f13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:23, skipping insertion in model container [2024-11-09 00:49:23,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:49:23" (1/1) ... [2024-11-09 00:49:23,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:49:24,096 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-38.i[915,928] [2024-11-09 00:49:24,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:49:24,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:49:24,187 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-38.i[915,928] [2024-11-09 00:49:24,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:49:24,241 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:49:24,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24 WrapperNode [2024-11-09 00:49:24,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:49:24,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:49:24,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:49:24,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:49:24,250 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:49:24" (1/1) ... [2024-11-09 00:49:24,264 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:49:24" (1/1) ... [2024-11-09 00:49:24,291 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-09 00:49:24,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:49:24,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:49:24,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:49:24,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:49:24,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,324 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:49:24,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:49:24,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:49:24,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:49:24,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:49:24,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (1/1) ... [2024-11-09 00:49:24,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:49:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:49:24,381 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:49:24,383 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:49:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:49:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:49:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:49:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:49:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:49:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:49:24,498 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:49:24,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:49:29,040 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:49:29,041 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:49:29,052 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:49:29,052 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:49:29,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:29 BoogieIcfgContainer [2024-11-09 00:49:29,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:49:29,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:49:29,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:49:29,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:49:29,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:49:23" (1/3) ... [2024-11-09 00:49:29,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c1772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:49:29, skipping insertion in model container [2024-11-09 00:49:29,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:24" (2/3) ... [2024-11-09 00:49:29,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c1772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:49:29, skipping insertion in model container [2024-11-09 00:49:29,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:29" (3/3) ... [2024-11-09 00:49:29,062 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-38.i [2024-11-09 00:49:29,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:49:29,076 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:49:29,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:49:29,152 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;@6fd85e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:49:29,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:49:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:49:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:49:29,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:29,173 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1048086186, now seen corresponding path program 1 times [2024-11-09 00:49:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:49:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846823925] [2024-11-09 00:49:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:29,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:49:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:49:29,209 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:49:29,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:49:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:29,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:49:29,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:49:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-09 00:49:29,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:49:29,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:49:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846823925] [2024-11-09 00:49:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846823925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:49:29,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:49:29,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:49:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616483891] [2024-11-09 00:49:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:49:29,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:49:29,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:49:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:49:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:49:29,726 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:49:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:49:29,761 INFO L93 Difference]: Finished difference Result 103 states and 174 transitions. [2024-11-09 00:49:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:49:29,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-09 00:49:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:49:29,771 INFO L225 Difference]: With dead ends: 103 [2024-11-09 00:49:29,771 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:49:29,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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:49:29,779 INFO L432 NwaCegarLoop]: 73 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, 73 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:49:29,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:49:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:49:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:49:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:49:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-09 00:49:29,829 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124 [2024-11-09 00:49:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:49:29,830 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-09 00:49:29,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:49:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-09 00:49:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:49:29,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:29,833 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,848 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:49:30,038 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:49:30,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:30,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash 531958366, now seen corresponding path program 1 times [2024-11-09 00:49:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:49:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136161705] [2024-11-09 00:49:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:30,043 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:49:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:49:30,044 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:49:30,045 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:49:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:30,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 00:49:30,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:49:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 231 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-09 00:49:58,355 INFO L311 TraceCheckSpWp]: Computing backward predicates...