./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.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 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:20:03,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:20:03,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:20:03,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:20:03,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:20:03,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:20:03,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:20:03,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:20:03,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:20:03,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:20:03,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:20:03,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:20:03,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:20:03,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:20:03,274 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:20:03,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:20:03,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:20:03,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:20:03,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:20:03,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:20:03,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:20:03,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:20:03,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:20:03,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:20:03,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:20:03,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:20:03,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:20:03,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:20:03,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:20:03,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:20:03,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:20:03,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:20:03,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:20:03,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:20:03,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:20:03,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:20:03,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:20:03,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:20:03,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:20:03,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:20:03,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:20:03,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:20:03,289 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 -> 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 [2024-10-14 11:20:03,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:20:03,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:20:03,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:20:03,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:20:03,570 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:20:03,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-14 11:20:04,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:20:05,045 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:20:05,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-14 11:20:05,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fe726b1/78763b0c5a844b17939232847c8b8716/FLAG7db34897c [2024-10-14 11:20:05,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fe726b1/78763b0c5a844b17939232847c8b8716 [2024-10-14 11:20:05,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:20:05,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:20:05,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:20:05,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:20:05,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:20:05,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8527c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05, skipping insertion in model container [2024-10-14 11:20:05,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:20:05,652 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-14 11:20:05,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:20:05,732 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:20:05,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-14 11:20:05,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:20:05,798 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:20:05,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05 WrapperNode [2024-10-14 11:20:05,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:20:05,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:20:05,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:20:05,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:20:05,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,857 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-14 11:20:05,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:20:05,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:20:05,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:20:05,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:20:05,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,904 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:20:05,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:20:05,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:20:05,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:20:05,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:20:05,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (1/1) ... [2024-10-14 11:20:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:20:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:20:05,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:20:05,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:20:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:20:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:20:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:20:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:20:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:20:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:20:06,114 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:20:06,116 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:20:06,484 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-14 11:20:06,484 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:20:06,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:20:06,530 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:20:06,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:20:06 BoogieIcfgContainer [2024-10-14 11:20:06,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:20:06,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:20:06,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:20:06,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:20:06,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:20:05" (1/3) ... [2024-10-14 11:20:06,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19954d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:20:06, skipping insertion in model container [2024-10-14 11:20:06,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:05" (2/3) ... [2024-10-14 11:20:06,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19954d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:20:06, skipping insertion in model container [2024-10-14 11:20:06,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:20:06" (3/3) ... [2024-10-14 11:20:06,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-14 11:20:06,551 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:20:06,551 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:20:06,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:20:06,610 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;@7b660a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:20:06,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:20:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 11:20:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 11:20:06,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:06,630 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:06,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:06,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1261380877, now seen corresponding path program 1 times [2024-10-14 11:20:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874627977] [2024-10-14 11:20:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:20:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:20:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:20:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:20:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:20:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:20:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:20:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:20:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:20:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:20:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:20:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:20:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:20:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:20:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:20:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:20:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:20:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:20:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:20:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:20:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:20:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:20:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:20:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:20:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:20:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:20:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:20:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 11:20:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:20:07,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874627977] [2024-10-14 11:20:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874627977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:20:07,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311845691] [2024-10-14 11:20:07,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:07,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:20:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:20:07,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:20:07,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:20:07,062 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 11:20:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:07,104 INFO L93 Difference]: Finished difference Result 171 states and 300 transitions. [2024-10-14 11:20:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:20:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2024-10-14 11:20:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:07,113 INFO L225 Difference]: With dead ends: 171 [2024-10-14 11:20:07,114 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 11:20:07,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:20:07,120 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:07,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:20:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 11:20:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 11:20:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 11:20:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-10-14 11:20:07,155 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 174 [2024-10-14 11:20:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:07,155 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-10-14 11:20:07,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 11:20:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-10-14 11:20:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 11:20:07,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:07,159 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:07,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:20:07,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:07,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1437934991, now seen corresponding path program 1 times [2024-10-14 11:20:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226364516] [2024-10-14 11:20:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:20:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:20:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:20:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:20:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:20:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:20:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:20:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:20:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:20:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:20:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:20:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:20:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:20:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:20:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:20:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:20:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:20:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:20:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:20:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:20:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:20:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:20:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:20:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:20:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:20:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:20:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:20:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 11:20:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:20:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226364516] [2024-10-14 11:20:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226364516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:20:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228409221] [2024-10-14 11:20:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:07,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:20:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:20:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:20:07,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:20:07,651 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:07,831 INFO L93 Difference]: Finished difference Result 197 states and 308 transitions. [2024-10-14 11:20:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:20:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-10-14 11:20:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:07,833 INFO L225 Difference]: With dead ends: 197 [2024-10-14 11:20:07,834 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 11:20:07,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:20:07,835 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 67 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:07,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 372 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:20:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 11:20:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-14 11:20:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 11:20:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2024-10-14 11:20:07,849 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 174 [2024-10-14 11:20:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:07,849 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2024-10-14 11:20:07,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2024-10-14 11:20:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 11:20:07,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:07,852 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:07,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:20:07,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -571973737, now seen corresponding path program 1 times [2024-10-14 11:20:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:07,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048809046] [2024-10-14 11:20:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:20:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:20:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:20:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:20:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:20:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:20:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:20:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:20:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:20:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:20:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:20:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:20:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:20:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:20:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:20:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:20:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:20:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:20:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:20:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:20:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:20:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:20:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:20:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:20:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:20:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:20:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:20:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 11:20:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:20:08,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048809046] [2024-10-14 11:20:08,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048809046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:08,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:08,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:20:08,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339623729] [2024-10-14 11:20:08,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:08,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:20:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:20:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:20:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:20:08,272 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:08,504 INFO L93 Difference]: Finished difference Result 317 states and 486 transitions. [2024-10-14 11:20:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:20:08,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-14 11:20:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:08,508 INFO L225 Difference]: With dead ends: 317 [2024-10-14 11:20:08,508 INFO L226 Difference]: Without dead ends: 230 [2024-10-14 11:20:08,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:20:08,510 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 167 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:08,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 363 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:20:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-14 11:20:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 196. [2024-10-14 11:20:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 11:20:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 299 transitions. [2024-10-14 11:20:08,534 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 299 transitions. Word has length 175 [2024-10-14 11:20:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:08,534 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 299 transitions. [2024-10-14 11:20:08,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 299 transitions. [2024-10-14 11:20:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 11:20:08,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:08,537 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:20:08,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -353119019, now seen corresponding path program 1 times [2024-10-14 11:20:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490228743] [2024-10-14 11:20:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:08,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:20:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:20:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:20:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:20:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:20:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:20:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:20:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:20:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:20:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:20:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:20:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:20:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:20:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:20:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:20:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:20:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:20:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:20:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:20:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:20:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:20:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:20:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:20:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:20:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:20:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:20:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:20:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 11:20:09,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:20:09,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490228743] [2024-10-14 11:20:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490228743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:09,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:20:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340763470] [2024-10-14 11:20:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:09,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:20:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:20:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:20:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:20:09,255 INFO L87 Difference]: Start difference. First operand 196 states and 299 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:09,643 INFO L93 Difference]: Finished difference Result 485 states and 731 transitions. [2024-10-14 11:20:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:20:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-14 11:20:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:09,647 INFO L225 Difference]: With dead ends: 485 [2024-10-14 11:20:09,647 INFO L226 Difference]: Without dead ends: 315 [2024-10-14 11:20:09,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:20:09,655 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 144 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:09,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 537 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:20:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-14 11:20:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 267. [2024-10-14 11:20:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 180 states have (on average 1.3666666666666667) internal successors, (246), 180 states have internal predecessors, (246), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-14 11:20:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 408 transitions. [2024-10-14 11:20:09,685 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 408 transitions. Word has length 175 [2024-10-14 11:20:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:09,685 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 408 transitions. [2024-10-14 11:20:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 408 transitions. [2024-10-14 11:20:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 11:20:09,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:09,688 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:09,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:20:09,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:09,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1162465645, now seen corresponding path program 1 times [2024-10-14 11:20:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144029832] [2024-10-14 11:20:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:20:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984162283] [2024-10-14 11:20:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:20:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:20:09,851 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-10-14 11:20:09,853 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-10-14 11:20:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:09,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 11:20:10,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:20:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 510 proven. 69 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2024-10-14 11:20:12,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:20:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:20:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144029832] [2024-10-14 11:20:13,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 11:20:13,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984162283] [2024-10-14 11:20:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984162283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:20:13,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 11:20:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-14 11:20:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409090455] [2024-10-14 11:20:13,872 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 11:20:13,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 11:20:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:20:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 11:20:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-14 11:20:13,873 INFO L87 Difference]: Start difference. First operand 267 states and 408 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 11:20:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:15,074 INFO L93 Difference]: Finished difference Result 944 states and 1397 transitions. [2024-10-14 11:20:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 11:20:15,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-10-14 11:20:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:15,079 INFO L225 Difference]: With dead ends: 944 [2024-10-14 11:20:15,079 INFO L226 Difference]: Without dead ends: 756 [2024-10-14 11:20:15,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 11:20:15,081 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 578 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:15,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 713 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 11:20:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-14 11:20:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 670. [2024-10-14 11:20:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 502 states have (on average 1.3844621513944224) internal successors, (695), 506 states have internal predecessors, (695), 151 states have call successors, (151), 16 states have call predecessors, (151), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2024-10-14 11:20:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 997 transitions. [2024-10-14 11:20:15,146 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 997 transitions. Word has length 175 [2024-10-14 11:20:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:15,146 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 997 transitions. [2024-10-14 11:20:15,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 11:20:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 997 transitions. [2024-10-14 11:20:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 11:20:15,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:15,149 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:15,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:20:15,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:20:15,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:15,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -461401067, now seen corresponding path program 1 times [2024-10-14 11:20:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788408562] [2024-10-14 11:20:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:20:15,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835972914] [2024-10-14 11:20:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:15,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:20:15,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:20:15,466 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-10-14 11:20:15,467 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-10-14 11:20:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:15,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 11:20:15,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:20:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 632 proven. 93 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-10-14 11:20:16,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:20:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:20:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788408562] [2024-10-14 11:20:16,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 11:20:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835972914] [2024-10-14 11:20:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835972914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:20:16,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 11:20:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-14 11:20:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507928573] [2024-10-14 11:20:16,474 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 11:20:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 11:20:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:20:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 11:20:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2024-10-14 11:20:16,476 INFO L87 Difference]: Start difference. First operand 670 states and 997 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-10-14 11:20:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:17,811 INFO L93 Difference]: Finished difference Result 2131 states and 3103 transitions. [2024-10-14 11:20:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-14 11:20:17,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 175 [2024-10-14 11:20:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:17,822 INFO L225 Difference]: With dead ends: 2131 [2024-10-14 11:20:17,822 INFO L226 Difference]: Without dead ends: 1580 [2024-10-14 11:20:17,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=939, Unknown=1, NotChecked=0, Total=1260 [2024-10-14 11:20:17,827 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 270 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:17,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1174 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 11:20:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-10-14 11:20:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 896. [2024-10-14 11:20:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 684 states have (on average 1.3903508771929824) internal successors, (951), 689 states have internal predecessors, (951), 182 states have call successors, (182), 29 states have call predecessors, (182), 29 states have return successors, (182), 177 states have call predecessors, (182), 182 states have call successors, (182) [2024-10-14 11:20:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1315 transitions. [2024-10-14 11:20:17,910 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1315 transitions. Word has length 175 [2024-10-14 11:20:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:17,913 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1315 transitions. [2024-10-14 11:20:17,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-10-14 11:20:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1315 transitions. [2024-10-14 11:20:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 11:20:17,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:17,915 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:17,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:20:18,116 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,SelfDestructingSolverStorable5 [2024-10-14 11:20:18,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:18,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1839421523, now seen corresponding path program 1 times [2024-10-14 11:20:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:20:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810199593] [2024-10-14 11:20:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:20:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:20:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106175678] [2024-10-14 11:20:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:20:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:20:18,224 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-10-14 11:20:18,228 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-10-14 11:20:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:20:18,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:20:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:20:18,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:20:18,589 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:20:18,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:20:18,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 11:20:18,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:20:18,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:18,923 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:20:18,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:20:18 BoogieIcfgContainer [2024-10-14 11:20:18,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:20:18,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:20:18,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:20:18,927 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:20:18,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:20:06" (3/4) ... [2024-10-14 11:20:18,932 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:20:18,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:20:18,934 INFO L158 Benchmark]: Toolchain (without parser) took 13503.62ms. Allocated memory was 134.2MB in the beginning and 446.7MB in the end (delta: 312.5MB). Free memory was 64.8MB in the beginning and 401.1MB in the end (delta: -336.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:20:18,934 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:20:18,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.82ms. Allocated memory was 134.2MB in the beginning and 243.3MB in the end (delta: 109.1MB). Free memory was 64.6MB in the beginning and 200.2MB in the end (delta: -135.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-14 11:20:18,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.66ms. Allocated memory is still 243.3MB. Free memory was 200.2MB in the beginning and 193.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:20:18,934 INFO L158 Benchmark]: Boogie Preprocessor took 87.54ms. Allocated memory is still 243.3MB. Free memory was 193.9MB in the beginning and 183.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 11:20:18,934 INFO L158 Benchmark]: RCFGBuilder took 584.03ms. Allocated memory is still 243.3MB. Free memory was 183.4MB in the beginning and 146.7MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-14 11:20:18,934 INFO L158 Benchmark]: TraceAbstraction took 12393.37ms. Allocated memory was 243.3MB in the beginning and 446.7MB in the end (delta: 203.4MB). Free memory was 145.7MB in the beginning and 401.1MB in the end (delta: -255.4MB). Peak memory consumption was 199.7MB. Max. memory is 16.1GB. [2024-10-14 11:20:18,935 INFO L158 Benchmark]: Witness Printer took 6.92ms. Allocated memory is still 446.7MB. Free memory is still 401.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:20:18,935 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.82ms. Allocated memory was 134.2MB in the beginning and 243.3MB in the end (delta: 109.1MB). Free memory was 64.6MB in the beginning and 200.2MB in the end (delta: -135.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.66ms. Allocated memory is still 243.3MB. Free memory was 200.2MB in the beginning and 193.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.54ms. Allocated memory is still 243.3MB. Free memory was 193.9MB in the beginning and 183.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 584.03ms. Allocated memory is still 243.3MB. Free memory was 183.4MB in the beginning and 146.7MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12393.37ms. Allocated memory was 243.3MB in the beginning and 446.7MB in the end (delta: 203.4MB). Free memory was 145.7MB in the beginning and 401.1MB in the end (delta: -255.4MB). Peak memory consumption was 199.7MB. Max. memory is 16.1GB. * Witness Printer took 6.92ms. Allocated memory is still 446.7MB. Free memory is still 401.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = -0.25; [L23] double var_1_2 = -0.125; [L24] double var_1_3 = 127.5; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 10; [L28] float var_1_7 = -0.2; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 0; [L34] unsigned char var_1_14 = 0; [L35] signed long int var_1_15 = -100000; [L36] signed char var_1_18 = 8; [L37] signed char var_1_19 = 64; [L38] signed short int var_1_20 = -16; [L39] signed long int var_1_22 = -1; [L40] double var_1_23 = 500.8; [L41] double var_1_24 = 9.8; [L42] unsigned short int var_1_25 = 16; [L43] unsigned short int var_1_26 = 41277; [L44] signed long int var_1_27 = 1000; [L45] double var_1_29 = 99.5; [L46] double var_1_30 = 99999999.6; [L47] unsigned long int var_1_31 = 4; [L48] unsigned short int var_1_32 = 10; [L49] unsigned short int var_1_33 = 52075; [L50] unsigned char last_1_var_1_4 = 4; [L51] unsigned char last_1_var_1_9 = 0; [L52] signed long int last_1_var_1_15 = -100000; [L53] signed short int last_1_var_1_20 = -16; [L54] signed long int last_1_var_1_22 = -1; [L55] unsigned short int last_1_var_1_32 = 10; [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L180] last_1_var_1_4 = var_1_4 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_22 = var_1_22 [L185] last_1_var_1_32 = var_1_32 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L137] RET assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L138] var_1_3 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L139] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L143] var_1_6 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L146] var_1_10 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L161] var_1_19 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L162] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L164] var_1_24 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L167] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L168] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L173] var_1_30 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L174] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L175] var_1_33 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_33 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_33 >= 49150) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L197] RET updateVariables() [L198] CALL step() [L59] signed long int stepLocal_7 = ((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4)))); VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_7=4, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L60] COND TRUE stepLocal_7 >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15) [L61] var_1_31 = (last_1_var_1_32 + (1891941459u - last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L65] COND FALSE !(\read(last_1_var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L68] var_1_1 = ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) [L69] var_1_29 = ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30))) [L70] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L71] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L80] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L85] COND FALSE !((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) [L88] var_1_25 = ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L90] unsigned char stepLocal_1 = var_1_6 <= var_1_31; [L91] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_0=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L92] COND FALSE !(stepLocal_0 > (var_1_25 * var_1_31)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L97] COND FALSE !(var_1_3 <= (- var_1_7)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L102] unsigned char stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L103] COND FALSE !(var_1_3 != var_1_29) [L110] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L112] EXPR var_1_4 >> var_1_18 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L112] COND FALSE !(var_1_6 >= (var_1_4 >> var_1_18)) [L115] signed char stepLocal_5 = var_1_18; [L116] signed char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L117] COND FALSE !(stepLocal_5 < var_1_19) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L120] COND FALSE !(((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == stepLocal_4) [L123] var_1_20 = -10 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L126] signed short int stepLocal_6 = var_1_20; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_6=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L127] COND FALSE !(stepLocal_6 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L188] EXPR ((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L188-L189] return ((((((((((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1)) && ((var_1_3 != var_1_29) ? (((var_1_32 <= var_1_31) && var_1_9) ? (var_1_18 == ((signed char) var_1_19)) : (var_1_18 == ((signed char) var_1_19))) : (var_1_18 == ((signed char) var_1_19)))) && ((var_1_18 < var_1_19) ? (var_1_20 == ((signed short int) (var_1_31 + var_1_19))) : ((((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == var_1_18) ? (var_1_20 == ((signed short int) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_20 == ((signed short int) -10))))) && ((var_1_20 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) ? ((! var_1_12) ? (var_1_22 == ((signed long int) (var_1_31 - var_1_20))) : (var_1_22 == ((signed long int) 2))) : 1)) && ((var_1_3 <= (- var_1_7)) ? (var_1_9 ? (var_1_23 == ((double) (var_1_24 - 31.25))) : 1) : 1)) && (((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) ? (var_1_25 == ((unsigned short int) ((((var_1_6) > (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32))))) ? (var_1_6) : (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32)))))))) : (var_1_25 == ((unsigned short int) ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))))))) && (var_1_29 == ((double) ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30)))))) && (((((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))))) >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15)) ? (var_1_31 == ((unsigned long int) (last_1_var_1_32 + (1891941459u - last_1_var_1_15)))) : (var_1_31 == ((unsigned long int) ((((((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) > (var_1_26)) ? (((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) : (var_1_26))))))) && (last_1_var_1_9 ? (var_1_32 == ((unsigned short int) ((var_1_33 - last_1_var_1_15) - var_1_6))) : 1) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 7, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1245 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 3288 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2511 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1849 IncrementalHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 777 mSDtfsCounter, 1849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 754 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 853 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1748 NumberOfCodeBlocks, 1748 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1042 ConstructedInterpolants, 6 QuantifiedInterpolants, 6348 SizeOfPredicates, 19 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 8262/8424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:20:18,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.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 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:20:21,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:20:21,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:20:21,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:20:21,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:20:21,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:20:21,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:20:21,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:20:21,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:20:21,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:20:21,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:20:21,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:20:21,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:20:21,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:20:21,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:20:21,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:20:21,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:20:21,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:20:21,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:20:21,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:20:21,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:20:21,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:20:21,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:20:21,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:20:21,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:20:21,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:20:21,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:20:21,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:20:21,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:20:21,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:20:21,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:20:21,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:20:21,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:20:21,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:20:21,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:20:21,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:20:21,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:20:21,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:20:21,166 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:20:21,166 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:20:21,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:20:21,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:20:21,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:20:21,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:20:21,167 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:20:21,167 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 -> 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 [2024-10-14 11:20:21,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:20:21,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:20:21,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:20:21,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:20:21,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:20:21,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-14 11:20:22,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:20:23,017 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:20:23,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-14 11:20:23,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7e26766/7edf2b87386a45fc9a779c075319beb7/FLAG6e853c028 [2024-10-14 11:20:23,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7e26766/7edf2b87386a45fc9a779c075319beb7 [2024-10-14 11:20:23,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:20:23,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:20:23,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:20:23,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:20:23,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:20:23,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8fea40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23, skipping insertion in model container [2024-10-14 11:20:23,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:20:23,566 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-14 11:20:23,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:20:23,722 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:20:23,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i[916,929] [2024-10-14 11:20:23,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:20:23,851 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:20:23,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23 WrapperNode [2024-10-14 11:20:23,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:20:23,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:20:23,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:20:23,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:20:23,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,919 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-14 11:20:23,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:20:23,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:20:23,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:20:23,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:20:23,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:20:23,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:23,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:24,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:24,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:24,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:24,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:20:24,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:20:24,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:20:24,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:20:24,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (1/1) ... [2024-10-14 11:20:24,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:20:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:20:24,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:20:24,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:20:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:20:24,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:20:24,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:20:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:20:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:20:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:20:24,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:20:24,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:20:27,812 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 11:20:27,813 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:20:27,879 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:20:27,879 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:20:27,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:20:27 BoogieIcfgContainer [2024-10-14 11:20:27,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:20:27,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:20:27,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:20:27,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:20:27,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:20:23" (1/3) ... [2024-10-14 11:20:27,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478642e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:20:27, skipping insertion in model container [2024-10-14 11:20:27,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:20:23" (2/3) ... [2024-10-14 11:20:27,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478642e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:20:27, skipping insertion in model container [2024-10-14 11:20:27,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:20:27" (3/3) ... [2024-10-14 11:20:27,892 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i [2024-10-14 11:20:27,906 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:20:27,907 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:20:27,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:20:27,975 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;@18810c55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:20:27,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:20:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 11:20:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 11:20:27,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:27,998 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:27,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1114480480, now seen corresponding path program 1 times [2024-10-14 11:20:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:20:28,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226167068] [2024-10-14 11:20:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:28,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:28,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:20:28,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:20:28,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:20:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:28,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:20:28,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:20:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-10-14 11:20:28,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:20:28,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:20:28,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226167068] [2024-10-14 11:20:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226167068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:20:28,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711086356] [2024-10-14 11:20:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:28,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:20:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:20:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:20:28,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:20:28,498 INFO L87 Difference]: Start difference. First operand has 79 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 11:20:31,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:20:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:31,060 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2024-10-14 11:20:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:20:31,068 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2024-10-14 11:20:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:31,078 INFO L225 Difference]: With dead ends: 157 [2024-10-14 11:20:31,078 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 11:20:31,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:20:31,086 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:31,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 11:20:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 11:20:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 11:20:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 11:20:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2024-10-14 11:20:31,129 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 171 [2024-10-14 11:20:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2024-10-14 11:20:31,130 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 11:20:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2024-10-14 11:20:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 11:20:31,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:31,133 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:31,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 11:20:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:31,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1616248670, now seen corresponding path program 1 times [2024-10-14 11:20:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:20:31,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755830657] [2024-10-14 11:20:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:31,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:20:31,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:20:31,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:20:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:31,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 11:20:31,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:20:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 11:20:32,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:20:32,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:20:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755830657] [2024-10-14 11:20:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755830657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:32,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:20:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357151699] [2024-10-14 11:20:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:32,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:20:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:20:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:20:32,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:20:32,735 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:36,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:20:39,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:20:42,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:20:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:42,954 INFO L93 Difference]: Finished difference Result 278 states and 441 transitions. [2024-10-14 11:20:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:20:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-14 11:20:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:42,963 INFO L225 Difference]: With dead ends: 278 [2024-10-14 11:20:42,963 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 11:20:42,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:20:42,965 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 176 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:42,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 340 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2024-10-14 11:20:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 11:20:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2024-10-14 11:20:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 11:20:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 234 transitions. [2024-10-14 11:20:42,989 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 234 transitions. Word has length 171 [2024-10-14 11:20:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:42,990 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 234 transitions. [2024-10-14 11:20:42,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 234 transitions. [2024-10-14 11:20:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 11:20:42,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:42,992 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:43,008 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:20:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:43,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 684573920, now seen corresponding path program 1 times [2024-10-14 11:20:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:20:43,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926630940] [2024-10-14 11:20:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:43,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:20:43,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:20:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:20:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:43,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 11:20:43,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:20:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 11:20:43,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:20:43,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:20:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926630940] [2024-10-14 11:20:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926630940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:20:43,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:20:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:20:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562746753] [2024-10-14 11:20:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:20:43,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:20:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:20:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:20:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:20:43,741 INFO L87 Difference]: Start difference. First operand 149 states and 234 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:46,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:20:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:20:46,578 INFO L93 Difference]: Finished difference Result 331 states and 515 transitions. [2024-10-14 11:20:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:20:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-14 11:20:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:20:46,581 INFO L225 Difference]: With dead ends: 331 [2024-10-14 11:20:46,581 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 11:20:46,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:20:46,583 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 59 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 11:20:46,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 361 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 11:20:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 11:20:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2024-10-14 11:20:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 108 states have internal predecessors, (139), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 11:20:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 279 transitions. [2024-10-14 11:20:46,606 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 279 transitions. Word has length 171 [2024-10-14 11:20:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:20:46,606 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 279 transitions. [2024-10-14 11:20:46,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 11:20:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 279 transitions. [2024-10-14 11:20:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 11:20:46,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:20:46,611 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:20:46,631 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 (4)] Ended with exit code 0 [2024-10-14 11:20:46,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:46,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:20:46,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:20:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1451857573, now seen corresponding path program 1 times [2024-10-14 11:20:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:20:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191767376] [2024-10-14 11:20:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:20:46,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:20:46,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:20:46,820 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-10-14 11:20:46,824 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-10-14 11:20:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:20:47,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 11:20:47,438 INFO L278 TraceCheckSpWp]: Computing forward predicates...