./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_fillercode_fillercodestructure_filler-ps-ci_file-65.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_fillercode_fillercodestructure_filler-ps-ci_file-65.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 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:12:16,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:12:16,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:12:16,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:12:16,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:12:16,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:12:16,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:12:16,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:12:16,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:12:16,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:12:16,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:12:16,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:12:16,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:12:16,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:12:16,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:12:16,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:12:16,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:12:16,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:12:16,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:12:16,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:12:16,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:12:16,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:12:16,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:12:16,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:12:16,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:12:16,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:12:16,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:12:16,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:12:16,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:12:16,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:12:16,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:12:16,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:12:16,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:12:16,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:12:16,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:12:16,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:12:16,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:12:16,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:12:16,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:12:16,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:12:16,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:12:16,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:12:16,697 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 -> 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 [2024-10-14 10:12:16,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:12:16,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:12:16,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:12:16,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:12:16,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:12:16,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-10-14 10:12:18,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:12:18,480 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:12:18,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-10-14 10:12:18,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c9d32bf/e5639e6a822e480ea201cdcf48243d46/FLAG81321372a [2024-10-14 10:12:18,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c9d32bf/e5639e6a822e480ea201cdcf48243d46 [2024-10-14 10:12:18,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:12:18,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:12:18,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:12:18,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:12:18,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:12:18,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:12:18" (1/1) ... [2024-10-14 10:12:18,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6180dea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:18, skipping insertion in model container [2024-10-14 10:12:18,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:12:18" (1/1) ... [2024-10-14 10:12:18,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:12:19,064 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_fillercode_fillercodestructure_filler-ps-ci_file-65.i[919,932] [2024-10-14 10:12:19,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:12:19,138 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:12:19,149 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_fillercode_fillercodestructure_filler-ps-ci_file-65.i[919,932] [2024-10-14 10:12:19,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:12:19,214 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:12:19,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19 WrapperNode [2024-10-14 10:12:19,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:12:19,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:12:19,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:12:19,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:12:19,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,275 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-10-14 10:12:19,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:12:19,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:12:19,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:12:19,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:12:19,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,308 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 10:12:19,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:12:19,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:12:19,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:12:19,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:12:19,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (1/1) ... [2024-10-14 10:12:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:12:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:12:19,375 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 10:12:19,378 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 10:12:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:12:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:12:19,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:12:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:12:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:12:19,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:12:19,507 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:12:19,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:12:19,899 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 10:12:19,900 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:12:19,931 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:12:19,931 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:12:19,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:12:19 BoogieIcfgContainer [2024-10-14 10:12:19,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:12:19,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:12:19,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:12:19,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:12:19,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:12:18" (1/3) ... [2024-10-14 10:12:19,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee7fd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:12:19, skipping insertion in model container [2024-10-14 10:12:19,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:19" (2/3) ... [2024-10-14 10:12:19,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee7fd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:12:19, skipping insertion in model container [2024-10-14 10:12:19,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:12:19" (3/3) ... [2024-10-14 10:12:19,940 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-10-14 10:12:19,959 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:12:19,960 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:12:20,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:12:20,025 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;@5de792fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:12:20,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:12:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 73 states have internal predecessors, (113), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-14 10:12:20,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:20,041 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:20,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:20,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1135743637, now seen corresponding path program 1 times [2024-10-14 10:12:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:20,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55141691] [2024-10-14 10:12:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:12:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:12:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:12:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:12:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:12:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:12:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:12:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:12:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:12:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:12:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:12:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:12:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:12:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:12:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:12:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:12:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:12:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:12:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:12:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:12:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:12:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:12:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:20,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:12:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55141691] [2024-10-14 10:12:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55141691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:20,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:20,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:12:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532025784] [2024-10-14 10:12:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:12:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:12:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:12:20,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:12:20,479 INFO L87 Difference]: Start difference. First operand has 97 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 73 states have internal predecessors, (113), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:12:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:20,514 INFO L93 Difference]: Finished difference Result 189 states and 332 transitions. [2024-10-14 10:12:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:12:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2024-10-14 10:12:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:20,524 INFO L225 Difference]: With dead ends: 189 [2024-10-14 10:12:20,524 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 10:12:20,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 10:12:20,531 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:20,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:12:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 10:12:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 10:12:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2024-10-14 10:12:20,574 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 148 [2024-10-14 10:12:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:20,575 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2024-10-14 10:12:20,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:12:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2024-10-14 10:12:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-14 10:12:20,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:20,580 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:20,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:12:20,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:20,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash -717563879, now seen corresponding path program 1 times [2024-10-14 10:12:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:20,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015756135] [2024-10-14 10:12:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:12:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:12:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:12:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:12:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:12:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:12:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:12:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:12:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:12:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:12:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:12:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:12:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:12:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:12:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:12:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:12:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:12:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:12:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:12:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:12:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:12:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:12:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:12:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015756135] [2024-10-14 10:12:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015756135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:20,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:12:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488736505] [2024-10-14 10:12:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:20,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:12:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:12:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:12:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:12:20,888 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:20,983 INFO L93 Difference]: Finished difference Result 277 states and 436 transitions. [2024-10-14 10:12:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:12:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-14 10:12:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:20,986 INFO L225 Difference]: With dead ends: 277 [2024-10-14 10:12:20,986 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 10:12:20,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:12:20,988 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 132 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:20,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 384 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:12:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 10:12:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 110. [2024-10-14 10:12:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 86 states have internal predecessors, (126), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 170 transitions. [2024-10-14 10:12:21,000 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 170 transitions. Word has length 148 [2024-10-14 10:12:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 170 transitions. [2024-10-14 10:12:21,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 170 transitions. [2024-10-14 10:12:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 10:12:21,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:21,004 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:12:21,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -310251331, now seen corresponding path program 1 times [2024-10-14 10:12:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834156577] [2024-10-14 10:12:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:12:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:12:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:12:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:12:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:12:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:12:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:12:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:12:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:12:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:12:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:12:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:12:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:12:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:12:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:12:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:12:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:12:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:12:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:12:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:12:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:12:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:12:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:12:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834156577] [2024-10-14 10:12:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834156577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:21,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:12:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945775469] [2024-10-14 10:12:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:12:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:12:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:12:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:12:21,218 INFO L87 Difference]: Start difference. First operand 110 states and 170 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:21,248 INFO L93 Difference]: Finished difference Result 200 states and 307 transitions. [2024-10-14 10:12:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:12:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-10-14 10:12:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:21,250 INFO L225 Difference]: With dead ends: 200 [2024-10-14 10:12:21,250 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 10:12:21,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:12:21,252 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:21,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:12:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 10:12:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 10:12:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 137 transitions. [2024-10-14 10:12:21,261 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 137 transitions. Word has length 149 [2024-10-14 10:12:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:21,262 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 137 transitions. [2024-10-14 10:12:21,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2024-10-14 10:12:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 10:12:21,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:21,267 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:21,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:12:21,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:21,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash -347896844, now seen corresponding path program 1 times [2024-10-14 10:12:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:21,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234244974] [2024-10-14 10:12:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:12:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:12:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:12:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:12:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:12:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:12:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:12:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:12:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:12:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:12:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:12:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:12:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:12:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:12:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:12:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:12:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:12:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:12:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:12:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:12:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:12:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:12:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:12:22,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234244974] [2024-10-14 10:12:22,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234244974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:22,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:12:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574242926] [2024-10-14 10:12:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:22,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:12:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:12:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:12:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:12:22,055 INFO L87 Difference]: Start difference. First operand 91 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:22,515 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2024-10-14 10:12:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:12:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-14 10:12:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:22,518 INFO L225 Difference]: With dead ends: 259 [2024-10-14 10:12:22,518 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 10:12:22,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:12:22,519 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 142 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:22,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 706 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:12:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 10:12:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 91. [2024-10-14 10:12:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-14 10:12:22,526 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 150 [2024-10-14 10:12:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:22,527 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-14 10:12:22,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-14 10:12:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 10:12:22,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:22,528 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:22,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:12:22,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:22,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1064407038, now seen corresponding path program 1 times [2024-10-14 10:12:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823869274] [2024-10-14 10:12:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:12:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:12:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:12:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:12:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:12:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:12:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:12:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:12:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:12:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:12:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:12:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:12:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:12:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:12:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:12:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:12:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:12:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:12:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:12:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:12:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:12:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:12:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 10:12:22,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:12:22,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823869274] [2024-10-14 10:12:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823869274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:12:22,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061241043] [2024-10-14 10:12:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:22,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:12:22,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:12:22,908 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 10:12:22,909 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 10:12:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:23,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 10:12:23,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:12:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-14 10:12:23,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:12:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 10:12:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061241043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:12:23,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:12:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2024-10-14 10:12:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962894810] [2024-10-14 10:12:23,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:12:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 10:12:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:12:23,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 10:12:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:12:23,738 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-10-14 10:12:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:24,217 INFO L93 Difference]: Finished difference Result 261 states and 387 transitions. [2024-10-14 10:12:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 10:12:24,217 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 154 [2024-10-14 10:12:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:24,219 INFO L225 Difference]: With dead ends: 261 [2024-10-14 10:12:24,219 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 10:12:24,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2024-10-14 10:12:24,226 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 474 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:24,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 449 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:12:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 10:12:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2024-10-14 10:12:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:12:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 217 transitions. [2024-10-14 10:12:24,245 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 217 transitions. Word has length 154 [2024-10-14 10:12:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:24,246 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 217 transitions. [2024-10-14 10:12:24,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-10-14 10:12:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 217 transitions. [2024-10-14 10:12:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 10:12:24,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:24,248 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:24,262 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 10:12:24,448 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 10:12:24,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1396964471, now seen corresponding path program 1 times [2024-10-14 10:12:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:24,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478774718] [2024-10-14 10:12:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:12:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:12:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:12:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:12:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:12:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:12:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:12:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:12:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:12:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:12:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:12:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:12:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:12:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:12:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:12:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:12:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:12:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:12:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:12:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:12:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:12:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:12:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:12:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478774718] [2024-10-14 10:12:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478774718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:12:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953611550] [2024-10-14 10:12:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:25,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:12:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:12:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:12:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:12:25,551 INFO L87 Difference]: Start difference. First operand 149 states and 217 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-14 10:12:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:26,350 INFO L93 Difference]: Finished difference Result 356 states and 493 transitions. [2024-10-14 10:12:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 10:12:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 155 [2024-10-14 10:12:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:26,352 INFO L225 Difference]: With dead ends: 356 [2024-10-14 10:12:26,352 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 10:12:26,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-10-14 10:12:26,353 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 796 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:26,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 322 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:12:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 10:12:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 173. [2024-10-14 10:12:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 118 states have internal predecessors, (146), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:12:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2024-10-14 10:12:26,404 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 155 [2024-10-14 10:12:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:26,404 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2024-10-14 10:12:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-14 10:12:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2024-10-14 10:12:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 10:12:26,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:26,406 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:26,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:12:26,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1655129909, now seen corresponding path program 1 times [2024-10-14 10:12:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:12:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766764699] [2024-10-14 10:12:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:12:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:12:26,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:12:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:12:26,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:12:26,572 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:12:26,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:12:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:12:26,578 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:12:26,683 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:12:26,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:12:26 BoogieIcfgContainer [2024-10-14 10:12:26,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:12:26,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:12:26,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:12:26,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:12:26,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:12:19" (3/4) ... [2024-10-14 10:12:26,689 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:12:26,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:12:26,690 INFO L158 Benchmark]: Toolchain (without parser) took 7818.23ms. Allocated memory was 201.3MB in the beginning and 346.0MB in the end (delta: 144.7MB). Free memory was 172.4MB in the beginning and 242.4MB in the end (delta: -70.0MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,690 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:12:26,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.83ms. Allocated memory is still 201.3MB. Free memory was 172.2MB in the beginning and 159.5MB in the end (delta: 12.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.52ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 155.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,692 INFO L158 Benchmark]: Boogie Preprocessor took 66.44ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 151.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,692 INFO L158 Benchmark]: RCFGBuilder took 587.79ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 120.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,692 INFO L158 Benchmark]: TraceAbstraction took 6752.51ms. Allocated memory was 201.3MB in the beginning and 346.0MB in the end (delta: 144.7MB). Free memory was 119.7MB in the beginning and 243.5MB in the end (delta: -123.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,692 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 346.0MB. Free memory was 243.5MB in the beginning and 242.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:12:26,693 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.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.83ms. Allocated memory is still 201.3MB. Free memory was 172.2MB in the beginning and 159.5MB in the end (delta: 12.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.52ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 155.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.44ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 151.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 587.79ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 120.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6752.51ms. Allocated memory was 201.3MB in the beginning and 346.0MB in the end (delta: 144.7MB). Free memory was 119.7MB in the beginning and 243.5MB in the end (delta: -123.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 346.0MB. Free memory was 243.5MB in the beginning and 242.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] unsigned short int var_1_33 = 16; [L43] unsigned char var_1_39 = 4; [L44] signed long int var_1_41 = -5; [L45] double var_1_42 = 49.6; [L46] signed long int var_1_45 = -2; [L47] unsigned long int var_1_47 = 16; [L48] unsigned long int var_1_50 = 1275815169; [L49] unsigned long int var_1_51 = 1483937619; [L50] signed short int last_1_var_1_1 = 4; [L51] unsigned char last_1_var_1_14 = 1; [L52] signed char last_1_var_1_16 = 50; [L53] signed long int last_1_var_1_23 = -16; [L54] unsigned char last_1_var_1_24 = 1; [L55] double last_1_var_1_28 = 5.5; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 [L180] last_1_var_1_23 = var_1_23 [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_28 = var_1_28 [L192] RET updateLastVariables() [L193] CALL updateVariables() [L141] var_1_11 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] var_1_13 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] var_1_21 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_22 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] var_1_25 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_26 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] var_1_50 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=1483937619, var_1_8=64] [L171] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=1483937619, var_1_8=64] [L171] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=1483937619, var_1_8=64] [L172] var_1_51 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L173] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L174] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L174] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L193] RET updateVariables() [L194] CALL step() [L59] var_1_29 = var_1_25 [L60] var_1_31 = var_1_19 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L61] COND TRUE \read(var_1_24) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L62] COND TRUE var_1_25 < var_1_19 [L63] var_1_33 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L70] var_1_39 = var_1_26 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L71] COND FALSE !(var_1_12 != var_1_1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L76] COND FALSE !(1000000.4f != var_1_21) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L81] COND TRUE var_1_24 && var_1_14 [L82] var_1_45 = (((((var_1_16 + var_1_26)) > (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? ((var_1_16 + var_1_26)) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=16, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L86] COND FALSE !(var_1_22 < var_1_22) [L99] var_1_47 = var_1_1 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L101] signed long int stepLocal_3 = last_1_var_1_23; [L102] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L103] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L114] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L116] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L116] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L117] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L121] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L122] var_1_28 = var_1_21 [L123] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L124] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L125] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L129] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L130] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L131] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L131] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L132] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L134] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L135] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L185] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L185] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L185-L186] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=1073741823, var_1_51=2147483647, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1545 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1544 mSDsluCounter, 2264 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1264 mSDsCounter, 568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 934 IncrementalHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 568 mSolverCounterUnsat, 1000 mSDtfsCounter, 934 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 606 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 264 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1213 NumberOfCodeBlocks, 1213 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1204 ConstructedInterpolants, 0 QuantifiedInterpolants, 4621 SizeOfPredicates, 5 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 7257/7392 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 10:12:26,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_filler-ps-ci_file-65.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 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:12:28,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:12:28,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:12:28,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:12:28,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:12:28,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:12:28,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:12:28,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:12:28,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:12:28,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:12:28,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:12:28,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:12:28,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:12:28,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:12:28,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:12:28,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:12:28,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:12:28,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:12:28,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:12:28,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:12:28,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:12:28,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:12:28,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:12:28,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:12:28,746 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:12:28,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:12:28,747 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:12:28,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:12:28,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:12:28,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:12:28,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:12:28,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:12:28,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:12:28,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:12:28,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:12:28,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:12:28,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:12:28,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:12:28,750 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:12:28,750 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:12:28,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:12:28,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:12:28,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:12:28,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:12:28,751 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:12:28,751 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 -> 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 [2024-10-14 10:12:29,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:12:29,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:12:29,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:12:29,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:12:29,061 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:12:29,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-10-14 10:12:30,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:12:30,656 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:12:30,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-10-14 10:12:30,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfce7871/87da39385b814071adb922430120023e/FLAG42dd40265 [2024-10-14 10:12:30,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfce7871/87da39385b814071adb922430120023e [2024-10-14 10:12:30,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:12:30,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:12:30,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:12:30,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:12:30,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:12:30,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:12:30" (1/1) ... [2024-10-14 10:12:30,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513a1716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:30, skipping insertion in model container [2024-10-14 10:12:30,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:12:30" (1/1) ... [2024-10-14 10:12:30,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:12:30,853 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_fillercode_fillercodestructure_filler-ps-ci_file-65.i[919,932] [2024-10-14 10:12:30,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:12:30,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:12:30,976 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_fillercode_fillercodestructure_filler-ps-ci_file-65.i[919,932] [2024-10-14 10:12:31,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:12:31,029 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:12:31,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31 WrapperNode [2024-10-14 10:12:31,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:12:31,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:12:31,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:12:31,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:12:31,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,079 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-14 10:12:31,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:12:31,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:12:31,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:12:31,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:12:31,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,110 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 10:12:31,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:12:31,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:12:31,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:12:31,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:12:31,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (1/1) ... [2024-10-14 10:12:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:12:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:12:31,158 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 10:12:31,160 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 10:12:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:12:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:12:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:12:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:12:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:12:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:12:31,261 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:12:31,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:12:32,526 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-14 10:12:32,527 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:12:32,580 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:12:32,580 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:12:32,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:12:32 BoogieIcfgContainer [2024-10-14 10:12:32,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:12:32,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:12:32,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:12:32,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:12:32,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:12:30" (1/3) ... [2024-10-14 10:12:32,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1698f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:12:32, skipping insertion in model container [2024-10-14 10:12:32,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:12:31" (2/3) ... [2024-10-14 10:12:32,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1698f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:12:32, skipping insertion in model container [2024-10-14 10:12:32,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:12:32" (3/3) ... [2024-10-14 10:12:32,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-10-14 10:12:32,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:12:32,601 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:12:32,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:12:32,656 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;@491f47a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:12:32,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:12:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 10:12:32,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:32,678 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:32,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1341550677, now seen corresponding path program 1 times [2024-10-14 10:12:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:12:32,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330085188] [2024-10-14 10:12:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:32,698 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 10:12:32,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:12:32,701 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 10:12:32,726 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 10:12:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:32,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:12:33,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:12:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-14 10:12:33,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:12:33,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:12:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330085188] [2024-10-14 10:12:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330085188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:12:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000872394] [2024-10-14 10:12:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:33,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:12:33,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:12:33,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:12:33,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:12:33,074 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:12:34,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:12:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:34,177 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2024-10-14 10:12:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:12:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-10-14 10:12:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:34,196 INFO L225 Difference]: With dead ends: 136 [2024-10-14 10:12:34,196 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 10:12:34,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 10:12:34,200 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:34,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 10:12:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 10:12:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 10:12:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:12:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-14 10:12:34,229 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 142 [2024-10-14 10:12:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:34,230 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-14 10:12:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:12:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-14 10:12:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 10:12:34,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:34,232 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:34,253 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 10:12:34,436 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 10:12:34,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:34,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -757946151, now seen corresponding path program 1 times [2024-10-14 10:12:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:12:34,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421810077] [2024-10-14 10:12:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:34,441 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 10:12:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:12:34,447 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 10:12:34,448 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 10:12:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:34,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:12:34,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:12:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:35,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:12:35,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:12:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421810077] [2024-10-14 10:12:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421810077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:12:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240589362] [2024-10-14 10:12:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:35,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:12:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:12:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:12:35,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:12:35,447 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:36,057 INFO L93 Difference]: Finished difference Result 187 states and 291 transitions. [2024-10-14 10:12:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:12:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-14 10:12:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:36,060 INFO L225 Difference]: With dead ends: 187 [2024-10-14 10:12:36,060 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 10:12:36,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:12:36,062 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:36,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 186 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:12:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 10:12:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2024-10-14 10:12:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:12:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2024-10-14 10:12:36,101 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 142 [2024-10-14 10:12:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:36,102 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2024-10-14 10:12:36,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2024-10-14 10:12:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 10:12:36,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:36,104 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:36,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 10:12:36,305 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 10:12:36,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:36,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:36,306 INFO L85 PathProgramCache]: Analyzing trace with hash -171140137, now seen corresponding path program 1 times [2024-10-14 10:12:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:12:36,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402098758] [2024-10-14 10:12:36,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:36,307 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 10:12:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:12:36,309 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 10:12:36,311 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 10:12:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:36,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:12:36,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:12:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:12:37,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:12:37,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:12:37,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402098758] [2024-10-14 10:12:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402098758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:12:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:12:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:12:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328076505] [2024-10-14 10:12:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:12:37,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:12:37,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:12:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:12:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:12:37,522 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:39,039 INFO L93 Difference]: Finished difference Result 196 states and 301 transitions. [2024-10-14 10:12:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:12:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-14 10:12:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:39,055 INFO L225 Difference]: With dead ends: 196 [2024-10-14 10:12:39,055 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 10:12:39,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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 10:12:39,056 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 60 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:39,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 10:12:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 10:12:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2024-10-14 10:12:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:12:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 184 transitions. [2024-10-14 10:12:39,073 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 184 transitions. Word has length 142 [2024-10-14 10:12:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:39,074 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 184 transitions. [2024-10-14 10:12:39,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:12:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 184 transitions. [2024-10-14 10:12:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 10:12:39,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:39,076 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:39,085 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 10:12:39,276 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 10:12:39,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:39,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash -851198507, now seen corresponding path program 1 times [2024-10-14 10:12:39,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:12:39,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439880210] [2024-10-14 10:12:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:39,278 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 10:12:39,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:12:39,281 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 10:12:39,282 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 10:12:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:39,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 10:12:39,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:12:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-14 10:12:39,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:12:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 10:12:39,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:12:39,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439880210] [2024-10-14 10:12:39,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439880210] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:12:39,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:12:39,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-14 10:12:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621735864] [2024-10-14 10:12:39,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:12:39,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:12:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:12:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:12:39,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:12:39,937 INFO L87 Difference]: Start difference. First operand 119 states and 184 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-14 10:12:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:41,269 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-10-14 10:12:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:12:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 142 [2024-10-14 10:12:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:41,271 INFO L225 Difference]: With dead ends: 198 [2024-10-14 10:12:41,271 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 10:12:41,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:12:41,273 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 182 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:41,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 181 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 10:12:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 10:12:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2024-10-14 10:12:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:12:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2024-10-14 10:12:41,289 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 142 [2024-10-14 10:12:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:41,290 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2024-10-14 10:12:41,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-14 10:12:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2024-10-14 10:12:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 10:12:41,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:41,291 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:41,302 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 (5)] Ended with exit code 0 [2024-10-14 10:12:41,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 10:12:41,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:41,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -627200073, now seen corresponding path program 1 times [2024-10-14 10:12:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:12:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088545679] [2024-10-14 10:12:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:41,494 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 10:12:41,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:12:41,497 INFO L229 MonitoredProcess]: Starting monitored process 6 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 10:12:41,497 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 (6)] Waiting until timeout for monitored process [2024-10-14 10:12:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:41,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 10:12:41,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:12:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2024-10-14 10:12:41,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:12:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 10:12:42,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:12:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088545679] [2024-10-14 10:12:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088545679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:12:42,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:12:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-14 10:12:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290551189] [2024-10-14 10:12:42,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:12:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:12:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:12:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:12:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:12:42,004 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 10:12:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:12:42,990 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-10-14 10:12:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 10:12:42,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 143 [2024-10-14 10:12:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:12:42,993 INFO L225 Difference]: With dead ends: 216 [2024-10-14 10:12:42,993 INFO L226 Difference]: Without dead ends: 147 [2024-10-14 10:12:42,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-14 10:12:42,997 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 111 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:12:42,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 338 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 10:12:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-14 10:12:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2024-10-14 10:12:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:12:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-10-14 10:12:43,035 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 143 [2024-10-14 10:12:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:12:43,036 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-10-14 10:12:43,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 10:12:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-10-14 10:12:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 10:12:43,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:12:43,038 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:43,048 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 (6)] Ended with exit code 0 [2024-10-14 10:12:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 10:12:43,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:12:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:12:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -627140491, now seen corresponding path program 1 times [2024-10-14 10:12:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:12:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514145036] [2024-10-14 10:12:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:12:43,243 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 10:12:43,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:12:43,246 INFO L229 MonitoredProcess]: Starting monitored process 7 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 10:12:43,247 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 (7)] Waiting until timeout for monitored process [2024-10-14 10:12:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:12:43,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 10:12:43,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:13:00,636 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 10:13:18,474 WARN L286 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 10:13:39,393 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)