./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.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_amount100_file-91.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 ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:30:42,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:30:42,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:30:42,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:30:42,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:30:42,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:30:42,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:30:42,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:30:42,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:30:42,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:30:42,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:30:42,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:30:42,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:30:42,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:30:42,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:30:42,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:30:42,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:30:42,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:30:42,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:30:42,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:30:42,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:30:42,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:30:42,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:30:42,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:30:42,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:30:42,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:30:42,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:30:42,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:30:42,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:30:42,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:30:42,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:30:42,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:30:42,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:30:42,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:30:42,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:30:42,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:30:42,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:30:42,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:30:42,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:30:42,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:30:42,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:30:42,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:30:42,276 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 -> ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 [2024-11-09 00:30:42,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:30:42,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:30:42,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:30:42,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:30:42,613 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:30:42,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-11-09 00:30:44,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:30:44,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:30:44,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-11-09 00:30:44,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975a29e9/06074b16cca049ada26c0b4caa5942a6/FLAG2ef4310fe [2024-11-09 00:30:44,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975a29e9/06074b16cca049ada26c0b4caa5942a6 [2024-11-09 00:30:44,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:30:44,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:30:44,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:30:44,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:30:44,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:30:44,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea68bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44, skipping insertion in model container [2024-11-09 00:30:44,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:30:44,471 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_amount100_file-91.i[916,929] [2024-11-09 00:30:44,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:30:44,594 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:30:44,605 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_amount100_file-91.i[916,929] [2024-11-09 00:30:44,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:30:44,674 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:30:44,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44 WrapperNode [2024-11-09 00:30:44,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:30:44,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:30:44,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:30:44,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:30:44,681 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:30:44" (1/1) ... [2024-11-09 00:30:44,707 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:30:44" (1/1) ... [2024-11-09 00:30:44,806 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-09 00:30:44,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:30:44,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:30:44,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:30:44,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:30:44,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,888 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:30:44,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:30:44,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:30:44,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:30:44,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:30:44,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (1/1) ... [2024-11-09 00:30:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:30:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:30:44,951 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:30:44,954 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:30:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:30:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:30:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:30:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:30:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:30:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:30:45,067 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:30:45,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:30:45,531 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 00:30:45,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:30:45,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:30:45,545 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:30:45,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:45 BoogieIcfgContainer [2024-11-09 00:30:45,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:30:45,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:30:45,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:30:45,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:30:45,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:30:44" (1/3) ... [2024-11-09 00:30:45,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44263e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:30:45, skipping insertion in model container [2024-11-09 00:30:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:44" (2/3) ... [2024-11-09 00:30:45,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44263e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:30:45, skipping insertion in model container [2024-11-09 00:30:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:45" (3/3) ... [2024-11-09 00:30:45,558 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-91.i [2024-11-09 00:30:45,576 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:30:45,576 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:30:45,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:30:45,669 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;@5ab1dd2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:30:45,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:30:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:30:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:30:45,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:45,700 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:45,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 76569582, now seen corresponding path program 1 times [2024-11-09 00:30:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:30:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382448000] [2024-11-09 00:30:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:30:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:30:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:30:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:30:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:30:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:30:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:30:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:30:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:30:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:30:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:30:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:30:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:30:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:30:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:30:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:30:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:30:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:30:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:30:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:30:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:30:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:30:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:30:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:30:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:30:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:30:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:30:46,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:30:46,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382448000] [2024-11-09 00:30:46,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382448000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:30:46,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:30:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:30:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284421905] [2024-11-09 00:30:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:30:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:30:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:30:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:30:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:30:46,346 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:30:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:46,388 INFO L93 Difference]: Finished difference Result 155 states and 267 transitions. [2024-11-09 00:30:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:30:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-09 00:30:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:46,401 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:30:46,401 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 00:30:46,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:30:46,413 INFO L432 NwaCegarLoop]: 117 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, 117 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:30:46,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:30:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 00:30:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 00:30:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:30:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-09 00:30:46,466 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 165 [2024-11-09 00:30:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:46,468 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-09 00:30:46,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:30:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-09 00:30:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:30:46,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:46,473 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:46,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:30:46,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:46,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 273050736, now seen corresponding path program 1 times [2024-11-09 00:30:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:30:46,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889035090] [2024-11-09 00:30:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:30:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:30:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:30:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:30:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:30:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:30:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:30:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:30:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:30:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:30:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:30:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:30:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:30:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:30:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:30:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:30:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:30:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:30:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:30:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:30:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:30:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:30:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:30:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:30:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:30:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:30:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:30:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:30:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889035090] [2024-11-09 00:30:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889035090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:30:47,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328314123] [2024-11-09 00:30:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:47,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:30:47,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:30:47,627 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:30:47,630 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:30:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:47,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 00:30:47,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 684 proven. 9 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-11-09 00:30:48,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:30:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:30:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328314123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:30:48,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:30:48,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-11-09 00:30:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514755763] [2024-11-09 00:30:48,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:30:48,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:30:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:30:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:30:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:30:48,535 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-09 00:30:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:49,415 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2024-11-09 00:30:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 00:30:49,416 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 165 [2024-11-09 00:30:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:49,419 INFO L225 Difference]: With dead ends: 207 [2024-11-09 00:30:49,419 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 00:30:49,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=621, Unknown=0, NotChecked=0, Total=870 [2024-11-09 00:30:49,421 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 222 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:30:49,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 421 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:30:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 00:30:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2024-11-09 00:30:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 00:30:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 183 transitions. [2024-11-09 00:30:49,443 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 183 transitions. Word has length 165 [2024-11-09 00:30:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:49,444 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 183 transitions. [2024-11-09 00:30:49,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-09 00:30:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 183 transitions. [2024-11-09 00:30:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:30:49,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:49,447 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:30:49,648 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:30:49,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:49,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -574470571, now seen corresponding path program 1 times [2024-11-09 00:30:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:30:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501492387] [2024-11-09 00:30:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:30:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:30:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:30:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:30:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:30:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:30:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:30:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:30:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:30:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:30:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:30:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:30:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:30:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:30:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:30:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:30:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:30:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:30:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:30:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:30:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:30:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:30:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:30:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:30:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:30:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:30:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:30:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:30:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501492387] [2024-11-09 00:30:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501492387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:30:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626764391] [2024-11-09 00:30:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:50,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:30:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:30:50,394 INFO L229 MonitoredProcess]: Starting monitored process 3 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:30:50,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:30:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:50,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 00:30:50,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-09 00:30:50,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:30:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:30:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626764391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:30:51,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:30:51,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 00:30:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272877653] [2024-11-09 00:30:51,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:30:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:30:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:30:51,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:30:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:30:51,071 INFO L87 Difference]: Start difference. First operand 128 states and 183 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-09 00:30:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:51,962 INFO L93 Difference]: Finished difference Result 333 states and 460 transitions. [2024-11-09 00:30:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 00:30:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 166 [2024-11-09 00:30:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:51,971 INFO L225 Difference]: With dead ends: 333 [2024-11-09 00:30:51,971 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 00:30:51,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 00:30:51,973 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 323 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:30:51,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 568 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:30:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 00:30:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 184. [2024-11-09 00:30:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 113 states have (on average 1.168141592920354) internal successors, (132), 115 states have internal predecessors, (132), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:30:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2024-11-09 00:30:52,047 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 166 [2024-11-09 00:30:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:52,047 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2024-11-09 00:30:52,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-09 00:30:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2024-11-09 00:30:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:30:52,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:52,051 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:52,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:30:52,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 00:30:52,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:52,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -316305133, now seen corresponding path program 1 times [2024-11-09 00:30:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:30:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795646269] [2024-11-09 00:30:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:30:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:30:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890497621] [2024-11-09 00:30:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:52,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:30:52,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:30:52,615 INFO L229 MonitoredProcess]: Starting monitored process 4 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:30:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:30:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:52,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 00:30:52,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 470 proven. 120 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-09 00:30:53,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795646269] [2024-11-09 00:31:06,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:31:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890497621] [2024-11-09 00:31:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890497621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:06,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:31:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-09 00:31:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869443418] [2024-11-09 00:31:06,681 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:06,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:31:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:31:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=110, Unknown=3, NotChecked=0, Total=156 [2024-11-09 00:31:06,682 INFO L87 Difference]: Start difference. First operand 184 states and 252 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-09 00:31:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:07,741 INFO L93 Difference]: Finished difference Result 354 states and 466 transitions. [2024-11-09 00:31:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 00:31:07,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2024-11-09 00:31:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:07,743 INFO L225 Difference]: With dead ends: 354 [2024-11-09 00:31:07,744 INFO L226 Difference]: Without dead ends: 220 [2024-11-09 00:31:07,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=84, Invalid=185, Unknown=3, NotChecked=0, Total=272 [2024-11-09 00:31:07,745 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 78 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:07,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 239 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 00:31:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-09 00:31:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2024-11-09 00:31:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 133 states have internal predecessors, (149), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:31:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2024-11-09 00:31:07,764 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 166 [2024-11-09 00:31:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:07,765 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2024-11-09 00:31:07,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-09 00:31:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2024-11-09 00:31:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:31:07,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:07,767 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:31:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:07,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash 704763221, now seen corresponding path program 1 times [2024-11-09 00:31:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489345633] [2024-11-09 00:31:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:07,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:31:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643814741] [2024-11-09 00:31:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:08,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:08,084 INFO L229 MonitoredProcess]: Starting monitored process 5 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:31:08,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:31:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:31:08,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:31:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:31:08,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:31:08,441 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:31:08,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:31:08,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:31:08,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:08,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 00:31:08,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:31:08,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:31:08 BoogieIcfgContainer [2024-11-09 00:31:08,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:31:08,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:31:08,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:31:08,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:31:08,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:45" (3/4) ... [2024-11-09 00:31:08,785 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:31:08,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:31:08,786 INFO L158 Benchmark]: Toolchain (without parser) took 24479.94ms. Allocated memory was 184.5MB in the beginning and 341.8MB in the end (delta: 157.3MB). Free memory was 114.5MB in the beginning and 298.7MB in the end (delta: -184.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:31:08,786 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 184.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:31:08,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.13ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 94.8MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:31:08,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.64ms. Allocated memory is still 184.5MB. Free memory was 94.6MB in the beginning and 151.2MB in the end (delta: -56.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-09 00:31:08,787 INFO L158 Benchmark]: Boogie Preprocessor took 110.15ms. Allocated memory is still 184.5MB. Free memory was 151.2MB in the beginning and 133.4MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:31:08,787 INFO L158 Benchmark]: RCFGBuilder took 624.67ms. Allocated memory is still 184.5MB. Free memory was 133.4MB in the beginning and 99.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-09 00:31:08,787 INFO L158 Benchmark]: TraceAbstraction took 23234.28ms. Allocated memory was 184.5MB in the beginning and 341.8MB in the end (delta: 157.3MB). Free memory was 98.9MB in the beginning and 298.7MB in the end (delta: -199.8MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2024-11-09 00:31:08,787 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 341.8MB. Free memory is still 298.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:31:08,788 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.37ms. Allocated memory is still 184.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.13ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 94.8MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.64ms. Allocated memory is still 184.5MB. Free memory was 94.6MB in the beginning and 151.2MB in the end (delta: -56.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.15ms. Allocated memory is still 184.5MB. Free memory was 151.2MB in the beginning and 133.4MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * RCFGBuilder took 624.67ms. Allocated memory is still 184.5MB. Free memory was 133.4MB in the beginning and 99.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23234.28ms. Allocated memory was 184.5MB in the beginning and 341.8MB in the end (delta: 157.3MB). Free memory was 98.9MB in the beginning and 298.7MB in the end (delta: -199.8MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 341.8MB. Free memory is still 298.7MB. 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 177. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 16; [L25] unsigned char var_1_6 = 16; [L26] signed short int var_1_7 = -8; [L27] signed char var_1_9 = 0; [L28] signed char var_1_10 = -4; [L29] double var_1_11 = 2.25; [L30] double var_1_12 = 199.3; [L31] double var_1_13 = 7.2; [L32] unsigned long int var_1_14 = 10; [L33] signed short int var_1_15 = -4; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_19 = 256; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = -1; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned short int var_1_25 = 100; [L42] double var_1_26 = 15.125; [L43] double var_1_27 = 2.3; [L44] double var_1_28 = 999.25; [L45] double var_1_29 = 1.75; [L46] unsigned short int var_1_30 = 43183; [L47] unsigned long int var_1_31 = 100000; [L48] double var_1_32 = 7.4; [L49] double var_1_33 = 31.125; [L50] signed short int var_1_34 = -128; [L51] signed char var_1_35 = -1; [L52] signed char last_1_var_1_9 = 0; [L53] signed short int last_1_var_1_19 = 256; [L54] unsigned long int last_1_var_1_31 = 100000; VAL [isInitial=0, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L172] last_1_var_1_9 = var_1_9 [L173] last_1_var_1_19 = var_1_19 [L174] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=16, var_1_7=-8, var_1_9=0] [L136] var_1_6 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_7=-8, var_1_9=0] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_7=-8, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L138] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L145] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L148] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L158] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L159] var_1_28 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L160] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L161] var_1_29 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L162] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L163] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L164] var_1_30 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L165] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L166] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L167] var_1_33 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L168] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_33 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L169] RET assume_abort_if_not(var_1_33 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L185] RET updateVariables() [L186] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_0=256, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L59] COND TRUE last_1_var_1_31 != stepLocal_0 [L60] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L64] var_1_34 = var_1_1 [L65] var_1_14 = ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1))) [L66] unsigned char stepLocal_4 = var_1_28 == (var_1_27 + var_1_29); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_4=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L67] COND FALSE !((var_1_1 > var_1_30) && stepLocal_4) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=32767, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L70] COND TRUE (var_1_29 / var_1_33) <= (- (var_1_12 + 10.1)) [L71] var_1_32 = var_1_26 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=-8, var_1_9=0] [L76] var_1_7 = ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L77] COND TRUE ((var_1_10 / var_1_4) / 1) <= var_1_1 [L78] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L80] var_1_35 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L81] COND TRUE var_1_10 == var_1_34 [L82] var_1_20 = (var_1_6 + var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L84] unsigned char stepLocal_3 = var_1_13 < (var_1_32 * var_1_12); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_3=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L85] COND FALSE !(stepLocal_3 && var_1_16) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L88] unsigned long int stepLocal_2 = var_1_14 - var_1_5; [L89] unsigned long int stepLocal_1 = (((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4))); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_1=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=0] [L90] COND FALSE !(stepLocal_1 < (last_1_var_1_9 * (var_1_6 + var_1_20))) [L95] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L97] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L104] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L115] COND FALSE !(! var_1_24) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L118] var_1_21 = (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L119] COND FALSE !(var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) [L126] var_1_25 = (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-124, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return (((((((((((((((last_1_var_1_31 != last_1_var_1_19) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (((((50) > (var_1_5)) ? (50) : (var_1_5))) + var_1_6)))) && (var_1_7 == ((signed short int) ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1)))))) && ((((((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4)))) < (last_1_var_1_9 * (var_1_6 + var_1_20))) ? ((var_1_20 < (var_1_14 - var_1_5)) ? (var_1_9 == ((signed char) var_1_10)) : 1) : (var_1_9 == ((signed char) var_1_10)))) && ((((var_1_10 / var_1_4) / 1) <= var_1_1) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (var_1_14 == ((unsigned long int) ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1)))))) && (var_1_22 ? (var_1_22 ? (var_1_15 == ((signed short int) ((((((((var_1_9) > (1000)) ? (var_1_9) : (1000))) < 0 ) ? -((((var_1_9) > (1000)) ? (var_1_9) : (1000))) : ((((var_1_9) > (1000)) ? (var_1_9) : (1000))))) + var_1_4))) : (var_1_15 == ((signed short int) ((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9)))))) : 1)) && (var_1_22 ? ((var_1_20 > var_1_15) ? (var_1_19 == ((signed short int) (var_1_34 + var_1_10))) : ((var_1_15 < var_1_4) ? (var_1_19 == ((signed short int) var_1_4)) : (var_1_19 == ((signed short int) var_1_5)))) : 1)) && ((var_1_10 == var_1_34) ? (var_1_20 == ((unsigned char) (var_1_6 + var_1_5))) : 1)) && (var_1_21 == ((signed long int) (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20))))))) && (((var_1_13 < (var_1_32 * var_1_12)) && var_1_16) ? (var_1_22 == ((unsigned char) (var_1_23 && var_1_24))) : 1)) && ((var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (((var_1_13 / var_1_29) < var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_25 == ((unsigned short int) (((((var_1_14 + var_1_20)) < (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))) ? ((var_1_14 + var_1_20)) : (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))))))) : (var_1_25 == ((unsigned short int) (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))))))) && ((! var_1_24) ? (var_1_31 == ((unsigned long int) (var_1_34 + ((((var_1_20) < (var_1_6)) ? (var_1_20) : (var_1_6)))))) : 1)) && (((var_1_1 > var_1_30) && (var_1_28 == (var_1_27 + var_1_29))) ? (var_1_32 == ((double) ((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) : (((var_1_29 / var_1_33) <= (- (var_1_12 + 10.1))) ? (var_1_32 == ((double) var_1_26)) : (var_1_32 == ((double) var_1_26))))) && (var_1_34 == ((signed short int) var_1_1))) && (var_1_35 == ((signed char) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=128, var_1_21=-126, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=32767, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=127, var_1_5=382, var_1_6=2, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 5, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 623 mSDsluCounter, 1345 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1474 IncrementalHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 484 mSDtfsCounter, 1474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 1100 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=4, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 74 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 1491 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1316 ConstructedInterpolants, 0 QuantifiedInterpolants, 3793 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 9324/9600 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:31:09,007 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-09 00:31:09,065 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 137 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_amount100_file-91.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 ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:31:11,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:11,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:31:11,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:11,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:31:11,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:11,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:31:11,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:31:11,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:31:11,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:31:11,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:11,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:31:11,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:11,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:11,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:31:11,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:11,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:11,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:11,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:11,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:11,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:11,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:11,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:11,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:31:11,471 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:31:11,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:11,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:31:11,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:11,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:11,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:11,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:11,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:31:11,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:31:11,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:31:11,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:11,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:11,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:11,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:11,487 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:31:11,488 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:31:11,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:31:11,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:31:11,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:31:11,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:31:11,489 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 -> ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 [2024-11-09 00:31:11,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:11,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:11,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:11,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:11,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:11,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-11-09 00:31:13,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:13,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:13,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-11-09 00:31:13,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cf7176a/cc2d988aabe74a7bad67e533c3305349/FLAG6deb92462 [2024-11-09 00:31:13,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cf7176a/cc2d988aabe74a7bad67e533c3305349 [2024-11-09 00:31:13,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:13,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:13,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:13,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:13,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:13,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:13" (1/1) ... [2024-11-09 00:31:13,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a7a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:13, skipping insertion in model container [2024-11-09 00:31:13,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:13" (1/1) ... [2024-11-09 00:31:13,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:13,885 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_amount100_file-91.i[916,929] [2024-11-09 00:31:13,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:13,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:13,974 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_amount100_file-91.i[916,929] [2024-11-09 00:31:14,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:14,027 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:14,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14 WrapperNode [2024-11-09 00:31:14,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:14,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:14,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:14,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:14,036 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:31:14" (1/1) ... [2024-11-09 00:31:14,049 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:31:14" (1/1) ... [2024-11-09 00:31:14,090 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-09 00:31:14,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:14,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:14,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:14,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:14,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,123 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:31:14,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:14,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:14,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:14,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:14,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (1/1) ... [2024-11-09 00:31:14,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:14,186 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:31:14,195 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:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:31:14,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:14,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:14,350 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:14,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:31:40,065 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 00:31:40,065 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:31:40,092 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:31:40,092 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:31:40,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:40 BoogieIcfgContainer [2024-11-09 00:31:40,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:31:40,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:31:40,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:31:40,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:31:40,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:31:13" (1/3) ... [2024-11-09 00:31:40,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eecfb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:40, skipping insertion in model container [2024-11-09 00:31:40,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:14" (2/3) ... [2024-11-09 00:31:40,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eecfb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:40, skipping insertion in model container [2024-11-09 00:31:40,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:40" (3/3) ... [2024-11-09 00:31:40,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-91.i [2024-11-09 00:31:40,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:31:40,142 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:31:40,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:31:40,326 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;@2cf1376d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:31:40,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:31:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:31:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:31:40,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:40,367 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash 76569582, now seen corresponding path program 1 times [2024-11-09 00:31:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:31:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916328066] [2024-11-09 00:31:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:40,411 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:31:40,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:31:40,422 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:31:40,423 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:31:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:41,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:31:41,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-09 00:31:41,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:31:41,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:31:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916328066] [2024-11-09 00:31:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916328066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:41,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:31:41,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056401238] [2024-11-09 00:31:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:31:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:31:41,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:31:41,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:31:41,878 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:31:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:41,924 INFO L93 Difference]: Finished difference Result 155 states and 267 transitions. [2024-11-09 00:31:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:31:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-09 00:31:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:41,932 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:31:41,932 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 00:31:41,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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:31:41,938 INFO L432 NwaCegarLoop]: 117 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, 117 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:31:41,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:31:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 00:31:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 00:31:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:31:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-09 00:31:41,975 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 165 [2024-11-09 00:31:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:41,976 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-09 00:31:41,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:31:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-09 00:31:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:31:41,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:41,981 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,013 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:31:42,182 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:31:42,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash 273050736, now seen corresponding path program 1 times [2024-11-09 00:31:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:31:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983152308] [2024-11-09 00:31:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:42,187 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:31:42,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:31:42,194 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:31:42,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:31:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:43,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:31:43,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-11-09 00:31:45,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:45,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:31:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983152308] [2024-11-09 00:31:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983152308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [100023268] [2024-11-09 00:31:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:31:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:31:45,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:31:45,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 00:31:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:49,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:31:49,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-11-09 00:31:50,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [100023268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:50,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:31:50,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-09 00:31:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149368654] [2024-11-09 00:31:50,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:31:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:31:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:31:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:31:50,502 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:31:58,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:02,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:06,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:06,586 INFO L93 Difference]: Finished difference Result 157 states and 236 transitions. [2024-11-09 00:32:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:32:06,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-09 00:32:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:06,734 INFO L225 Difference]: With dead ends: 157 [2024-11-09 00:32:06,734 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 00:32:06,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:32:06,736 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 79 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:32:06,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 210 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2024-11-09 00:32:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 00:32:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-09 00:32:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:32:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-09 00:32:06,752 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 165 [2024-11-09 00:32:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:06,753 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-09 00:32:06,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:32:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-09 00:32:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:32:06,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:06,757 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:06,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 00:32:06,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:32:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:32:07,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:07,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1945489363, now seen corresponding path program 1 times [2024-11-09 00:32:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937519902] [2024-11-09 00:32:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:07,160 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:32:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:07,162 INFO L229 MonitoredProcess]: Starting monitored process 5 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:32:07,164 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 (5)] Waiting until timeout for monitored process [2024-11-09 00:32:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:08,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:32:08,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 680 proven. 63 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-09 00:32:15,425 INFO L311 TraceCheckSpWp]: Computing backward predicates...