./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.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 f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:48:49,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:48:49,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:48:49,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:48:49,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:48:49,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:48:49,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:48:49,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:48:49,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:48:49,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:48:49,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:48:49,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:48:49,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:48:49,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:48:49,616 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:48:49,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:48:49,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:48:49,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:48:49,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:48:49,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:48:49,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:48:49,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:48:49,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:48:49,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:48:49,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:48:49,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:48:49,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:48:49,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:48:49,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:48:49,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:48:49,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:48:49,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:48:49,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:48:49,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:48:49,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:48:49,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:48:49,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:48:49,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:48:49,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:48:49,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:48:49,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:48:49,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:48:49,623 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 -> f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 [2024-11-18 20:48:49,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:48:49,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:48:49,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:48:49,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:48:49,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:48:49,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-11-18 20:48:50,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:48:51,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:48:51,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-11-18 20:48:51,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0920e02b9/feb1679b266546409d127125597caf5f/FLAG527f71e3a [2024-11-18 20:48:51,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0920e02b9/feb1679b266546409d127125597caf5f [2024-11-18 20:48:51,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:48:51,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:48:51,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:48:51,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:48:51,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:48:51,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:51,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a024622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51, skipping insertion in model container [2024-11-18 20:48:51,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:51,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:48:51,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-11-18 20:48:51,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:48:51,876 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:48:51,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-11-18 20:48:51,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:48:51,939 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:48:51,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51 WrapperNode [2024-11-18 20:48:51,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:48:51,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:48:51,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:48:51,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:48:51,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:51,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:51,984 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-18 20:48:51,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:48:51,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:48:51,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:48:51,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:48:51,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:51,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:51,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,011 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:48:52,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:48:52,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:48:52,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:48:52,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:48:52,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (1/1) ... [2024-11-18 20:48:52,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:48:52,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:52,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 20:48:52,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 20:48:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:48:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:48:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:48:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:48:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:48:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:48:52,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:48:52,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:48:52,516 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-18 20:48:52,517 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:48:52,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:48:52,529 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:48:52,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:52 BoogieIcfgContainer [2024-11-18 20:48:52,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:48:52,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:48:52,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:48:52,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:48:52,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:48:51" (1/3) ... [2024-11-18 20:48:52,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cc1430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:52, skipping insertion in model container [2024-11-18 20:48:52,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:51" (2/3) ... [2024-11-18 20:48:52,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cc1430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:52, skipping insertion in model container [2024-11-18 20:48:52,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:52" (3/3) ... [2024-11-18 20:48:52,536 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-11-18 20:48:52,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:48:52,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:48:52,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:48:52,602 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;@37486e40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:48:52,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:48:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 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-11-18 20:48:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-18 20:48:52,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:52,618 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-11-18 20:48:52,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:52,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -211705958, now seen corresponding path program 1 times [2024-11-18 20:48:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:52,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617008067] [2024-11-18 20:48:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-18 20:48:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:52,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617008067] [2024-11-18 20:48:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617008067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:48:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75462089] [2024-11-18 20:48:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:52,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:52,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:52,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:48:52,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 20:48:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:53,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:48:53,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-18 20:48:53,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:48:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75462089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:48:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:48:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491807987] [2024-11-18 20:48:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:53,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:48:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:48:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:48:53,136 INFO L87 Difference]: Start difference. First operand has 99 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 20:48:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:53,163 INFO L93 Difference]: Finished difference Result 190 states and 322 transitions. [2024-11-18 20:48:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:48:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 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 155 [2024-11-18 20:48:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:53,172 INFO L225 Difference]: With dead ends: 190 [2024-11-18 20:48:53,172 INFO L226 Difference]: Without dead ends: 94 [2024-11-18 20:48:53,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:48:53,179 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:53,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:48:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-18 20:48:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-18 20:48:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 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-11-18 20:48:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-11-18 20:48:53,259 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 155 [2024-11-18 20:48:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:53,260 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-11-18 20:48:53,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 20:48:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-11-18 20:48:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-18 20:48:53,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:53,263 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-11-18 20:48:53,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 20:48:53,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 20:48:53,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:53,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -542108596, now seen corresponding path program 1 times [2024-11-18 20:48:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114367714] [2024-11-18 20:48:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:48:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:53,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114367714] [2024-11-18 20:48:53,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114367714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:53,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:48:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569132865] [2024-11-18 20:48:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:53,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:48:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:53,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:48:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:48:53,671 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-18 20:48:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:53,725 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2024-11-18 20:48:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:48:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 155 [2024-11-18 20:48:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:53,728 INFO L225 Difference]: With dead ends: 243 [2024-11-18 20:48:53,728 INFO L226 Difference]: Without dead ends: 152 [2024-11-18 20:48:53,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 20:48:53,729 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:53,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 289 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:48:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-18 20:48:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2024-11-18 20:48:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 117 states have internal predecessors, (156), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-18 20:48:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 216 transitions. [2024-11-18 20:48:53,750 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 216 transitions. Word has length 155 [2024-11-18 20:48:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:53,753 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 216 transitions. [2024-11-18 20:48:53,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-18 20:48:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2024-11-18 20:48:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-18 20:48:53,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:53,757 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-11-18 20:48:53,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:48:53,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:53,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash 158955982, now seen corresponding path program 1 times [2024-11-18 20:48:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:53,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40040563] [2024-11-18 20:48:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:48:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40040563] [2024-11-18 20:48:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40040563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:53,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:53,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:48:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980535861] [2024-11-18 20:48:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:53,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:48:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:53,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:48:53,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:48:53,985 INFO L87 Difference]: Start difference. First operand 149 states and 216 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-18 20:48:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:54,063 INFO L93 Difference]: Finished difference Result 297 states and 433 transitions. [2024-11-18 20:48:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:48:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 155 [2024-11-18 20:48:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:54,074 INFO L225 Difference]: With dead ends: 297 [2024-11-18 20:48:54,074 INFO L226 Difference]: Without dead ends: 151 [2024-11-18 20:48:54,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-18 20:48:54,078 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:54,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:48:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-18 20:48:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-18 20:48:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 119 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-18 20:48:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2024-11-18 20:48:54,098 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 155 [2024-11-18 20:48:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2024-11-18 20:48:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-18 20:48:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2024-11-18 20:48:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 20:48:54,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:54,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:48:54,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2034480870, now seen corresponding path program 1 times [2024-11-18 20:48:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:54,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367038638] [2024-11-18 20:48:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:48:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367038638] [2024-11-18 20:48:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367038638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:48:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518956771] [2024-11-18 20:48:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:48:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:48:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:48:54,697 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-11-18 20:48:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:54,946 INFO L93 Difference]: Finished difference Result 436 states and 629 transitions. [2024-11-18 20:48:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:48:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 157 [2024-11-18 20:48:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:54,950 INFO L225 Difference]: With dead ends: 436 [2024-11-18 20:48:54,952 INFO L226 Difference]: Without dead ends: 288 [2024-11-18 20:48:54,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:48:54,953 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 120 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:54,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 449 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:48:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-18 20:48:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 198. [2024-11-18 20:48:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 142 states have internal predecessors, (181), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-18 20:48:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 285 transitions. [2024-11-18 20:48:54,986 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 285 transitions. Word has length 157 [2024-11-18 20:48:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:54,986 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 285 transitions. [2024-11-18 20:48:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-11-18 20:48:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 285 transitions. [2024-11-18 20:48:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-18 20:48:54,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:54,990 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, 1, 1, 1] [2024-11-18 20:48:54,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:48:54,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1310828558, now seen corresponding path program 1 times [2024-11-18 20:48:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:54,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339890887] [2024-11-18 20:48:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:48:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339890887] [2024-11-18 20:48:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339890887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:55,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 20:48:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935640766] [2024-11-18 20:48:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 20:48:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 20:48:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 20:48:55,456 INFO L87 Difference]: Start difference. First operand 198 states and 285 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-11-18 20:48:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:55,678 INFO L93 Difference]: Finished difference Result 436 states and 628 transitions. [2024-11-18 20:48:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:48:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 158 [2024-11-18 20:48:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:55,680 INFO L225 Difference]: With dead ends: 436 [2024-11-18 20:48:55,680 INFO L226 Difference]: Without dead ends: 288 [2024-11-18 20:48:55,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:48:55,681 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 118 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:55,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 450 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:48:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-18 20:48:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 199. [2024-11-18 20:48:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 143 states have internal predecessors, (182), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-18 20:48:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2024-11-18 20:48:55,708 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 158 [2024-11-18 20:48:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:55,709 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2024-11-18 20:48:55,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-11-18 20:48:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2024-11-18 20:48:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-18 20:48:55,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:55,712 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, 1, 1, 1] [2024-11-18 20:48:55,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:48:55,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:55,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash 801355468, now seen corresponding path program 1 times [2024-11-18 20:48:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828482247] [2024-11-18 20:48:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:56,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-11-18 20:48:56,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:56,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828482247] [2024-11-18 20:48:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828482247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:56,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:56,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 20:48:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666393907] [2024-11-18 20:48:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:56,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 20:48:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 20:48:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:48:56,218 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-11-18 20:48:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:56,719 INFO L93 Difference]: Finished difference Result 541 states and 767 transitions. [2024-11-18 20:48:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 20:48:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 158 [2024-11-18 20:48:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:56,722 INFO L225 Difference]: With dead ends: 541 [2024-11-18 20:48:56,722 INFO L226 Difference]: Without dead ends: 393 [2024-11-18 20:48:56,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:48:56,723 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 189 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:56,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 478 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 20:48:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-18 20:48:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 324. [2024-11-18 20:48:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.2834008097165992) internal successors, (317), 250 states have internal predecessors, (317), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 20:48:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 457 transitions. [2024-11-18 20:48:56,761 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 457 transitions. Word has length 158 [2024-11-18 20:48:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:56,761 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 457 transitions. [2024-11-18 20:48:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-11-18 20:48:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 457 transitions. [2024-11-18 20:48:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-18 20:48:56,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:56,763 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, 1, 1, 1] [2024-11-18 20:48:56,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 20:48:56,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:56,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1481413838, now seen corresponding path program 1 times [2024-11-18 20:48:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:56,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316670994] [2024-11-18 20:48:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:48:57,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:57,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316670994] [2024-11-18 20:48:57,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316670994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:57,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:57,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:48:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169082915] [2024-11-18 20:48:57,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:57,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:48:57,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:48:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:48:57,156 INFO L87 Difference]: Start difference. First operand 324 states and 457 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-11-18 20:48:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:57,319 INFO L93 Difference]: Finished difference Result 617 states and 877 transitions. [2024-11-18 20:48:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:48:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 158 [2024-11-18 20:48:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:57,322 INFO L225 Difference]: With dead ends: 617 [2024-11-18 20:48:57,322 INFO L226 Difference]: Without dead ends: 344 [2024-11-18 20:48:57,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:48:57,324 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 105 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:57,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 350 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:48:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-18 20:48:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 324. [2024-11-18 20:48:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 250 states have internal predecessors, (313), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 20:48:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 453 transitions. [2024-11-18 20:48:57,365 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 453 transitions. Word has length 158 [2024-11-18 20:48:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:57,365 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 453 transitions. [2024-11-18 20:48:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-11-18 20:48:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 453 transitions. [2024-11-18 20:48:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-18 20:48:57,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:57,368 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, 1, 1, 1, 1, 1] [2024-11-18 20:48:57,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 20:48:57,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:57,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash -375598977, now seen corresponding path program 1 times [2024-11-18 20:48:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046601336] [2024-11-18 20:48:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:48:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046601336] [2024-11-18 20:48:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046601336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:48:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90956488] [2024-11-18 20:48:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:57,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:57,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:48:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 20:48:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:57,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 20:48:57,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-18 20:48:57,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:48:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:48:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90956488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:48:57,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:48:57,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-18 20:48:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166603204] [2024-11-18 20:48:57,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:48:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 20:48:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 20:48:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:48:57,994 INFO L87 Difference]: Start difference. First operand 324 states and 453 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-18 20:48:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:58,187 INFO L93 Difference]: Finished difference Result 590 states and 820 transitions. [2024-11-18 20:48:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 20:48:58,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 160 [2024-11-18 20:48:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:58,190 INFO L225 Difference]: With dead ends: 590 [2024-11-18 20:48:58,190 INFO L226 Difference]: Without dead ends: 317 [2024-11-18 20:48:58,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:48:58,191 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 221 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:58,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 219 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:48:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-18 20:48:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2024-11-18 20:48:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.2300884955752212) internal successors, (278), 229 states have internal predecessors, (278), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 20:48:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 418 transitions. [2024-11-18 20:48:58,223 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 418 transitions. Word has length 160 [2024-11-18 20:48:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:58,224 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 418 transitions. [2024-11-18 20:48:58,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-18 20:48:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 418 transitions. [2024-11-18 20:48:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-18 20:48:58,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:58,225 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, 1, 1, 1, 1, 1] [2024-11-18 20:48:58,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 20:48:58,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-18 20:48:58,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:58,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1124328974, now seen corresponding path program 1 times [2024-11-18 20:48:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661949453] [2024-11-18 20:48:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:48:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661949453] [2024-11-18 20:48:58,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661949453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:58,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:58,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 20:48:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601099211] [2024-11-18 20:48:58,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:58,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 20:48:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 20:48:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:48:58,738 INFO L87 Difference]: Start difference. First operand 305 states and 418 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 20:48:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:59,287 INFO L93 Difference]: Finished difference Result 722 states and 988 transitions. [2024-11-18 20:48:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 20:48:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 160 [2024-11-18 20:48:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:59,291 INFO L225 Difference]: With dead ends: 722 [2024-11-18 20:48:59,291 INFO L226 Difference]: Without dead ends: 472 [2024-11-18 20:48:59,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-18 20:48:59,293 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 282 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:59,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 364 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 20:48:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-18 20:48:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 324. [2024-11-18 20:48:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 245 states have (on average 1.236734693877551) internal successors, (303), 248 states have internal predecessors, (303), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 20:48:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2024-11-18 20:48:59,338 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 160 [2024-11-18 20:48:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:59,339 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2024-11-18 20:48:59,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 20:48:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2024-11-18 20:48:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-18 20:48:59,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:59,340 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, 1, 1, 1, 1, 1] [2024-11-18 20:48:59,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 20:48:59,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:59,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1825393552, now seen corresponding path program 1 times [2024-11-18 20:48:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566244630] [2024-11-18 20:48:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:48:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:59,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566244630] [2024-11-18 20:48:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566244630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:48:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045870377] [2024-11-18 20:48:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:59,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:59,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:59,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:48:59,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 20:48:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:59,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 20:48:59,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-18 20:48:59,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:48:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:48:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045870377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:48:59,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:48:59,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-18 20:48:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697081328] [2024-11-18 20:48:59,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:48:59,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 20:48:59,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 20:48:59,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-18 20:48:59,900 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-18 20:49:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:00,139 INFO L93 Difference]: Finished difference Result 586 states and 799 transitions. [2024-11-18 20:49:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:49:00,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 160 [2024-11-18 20:49:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:00,142 INFO L225 Difference]: With dead ends: 586 [2024-11-18 20:49:00,142 INFO L226 Difference]: Without dead ends: 317 [2024-11-18 20:49:00,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:49:00,143 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 209 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:00,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 339 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:49:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-18 20:49:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2024-11-18 20:49:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.2123893805309736) internal successors, (274), 229 states have internal predecessors, (274), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 20:49:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 414 transitions. [2024-11-18 20:49:00,173 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 414 transitions. Word has length 160 [2024-11-18 20:49:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:00,173 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 414 transitions. [2024-11-18 20:49:00,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-18 20:49:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 414 transitions. [2024-11-18 20:49:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-18 20:49:00,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:00,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:49:00,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 20:49:00,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:49:00,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:00,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 637982935, now seen corresponding path program 1 times [2024-11-18 20:49:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:49:00,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233571022] [2024-11-18 20:49:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:00,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:49:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:49:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:49:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233571022] [2024-11-18 20:49:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233571022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:49:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630063029] [2024-11-18 20:49:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:00,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:49:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:49:00,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:49:00,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 20:49:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:01,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 20:49:01,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:49:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 562 proven. 54 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-18 20:49:01,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:49:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-18 20:49:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630063029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:49:02,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:49:02,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 28 [2024-11-18 20:49:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17354103] [2024-11-18 20:49:02,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:49:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-18 20:49:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:49:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-18 20:49:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2024-11-18 20:49:02,414 INFO L87 Difference]: Start difference. First operand 305 states and 414 transitions. Second operand has 28 states, 27 states have (on average 5.333333333333333) internal successors, (144), 28 states have internal predecessors, (144), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-11-18 20:49:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:03,968 INFO L93 Difference]: Finished difference Result 867 states and 1155 transitions. [2024-11-18 20:49:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-18 20:49:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.333333333333333) internal successors, (144), 28 states have internal predecessors, (144), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) Word has length 164 [2024-11-18 20:49:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:03,975 INFO L225 Difference]: With dead ends: 867 [2024-11-18 20:49:03,975 INFO L226 Difference]: Without dead ends: 617 [2024-11-18 20:49:03,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=991, Invalid=2431, Unknown=0, NotChecked=0, Total=3422 [2024-11-18 20:49:03,977 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 720 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:03,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 698 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 20:49:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-18 20:49:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 373. [2024-11-18 20:49:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 292 states have (on average 1.202054794520548) internal successors, (351), 295 states have internal predecessors, (351), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 20:49:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 491 transitions. [2024-11-18 20:49:04,012 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 491 transitions. Word has length 164 [2024-11-18 20:49:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:04,012 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 491 transitions. [2024-11-18 20:49:04,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.333333333333333) internal successors, (144), 28 states have internal predecessors, (144), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-11-18 20:49:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 491 transitions. [2024-11-18 20:49:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-18 20:49:04,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:04,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:49:04,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 20:49:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:49:04,215 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1339047513, now seen corresponding path program 1 times [2024-11-18 20:49:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:49:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486743233] [2024-11-18 20:49:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:49:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:49:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282721218] [2024-11-18 20:49:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:49:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:49:04,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:49:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 20:49:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:49:04,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 20:49:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:49:04,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 20:49:04,736 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 20:49:04,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 20:49:04,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 20:49:04,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-18 20:49:04,943 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:49:05,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 20:49:05,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:49:05 BoogieIcfgContainer [2024-11-18 20:49:05,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 20:49:05,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 20:49:05,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 20:49:05,042 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 20:49:05,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:52" (3/4) ... [2024-11-18 20:49:05,045 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 20:49:05,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 20:49:05,046 INFO L158 Benchmark]: Toolchain (without parser) took 13480.91ms. Allocated memory was 184.5MB in the beginning and 415.2MB in the end (delta: 230.7MB). Free memory was 129.0MB in the beginning and 191.4MB in the end (delta: -62.4MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2024-11-18 20:49:05,046 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory was 52.8MB in the beginning and 52.7MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:49:05,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.48ms. Allocated memory is still 184.5MB. Free memory was 128.6MB in the beginning and 152.0MB in the end (delta: -23.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 20:49:05,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.22ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 147.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 20:49:05,047 INFO L158 Benchmark]: Boogie Preprocessor took 42.97ms. Allocated memory is still 184.5MB. Free memory was 147.8MB in the beginning and 141.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 20:49:05,047 INFO L158 Benchmark]: RCFGBuilder took 501.43ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 112.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-18 20:49:05,047 INFO L158 Benchmark]: TraceAbstraction took 12510.24ms. Allocated memory was 184.5MB in the beginning and 415.2MB in the end (delta: 230.7MB). Free memory was 111.1MB in the beginning and 191.4MB in the end (delta: -80.3MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2024-11-18 20:49:05,047 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 415.2MB. Free memory is still 191.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:49:05,048 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.13ms. Allocated memory is still 98.6MB. Free memory was 52.8MB in the beginning and 52.7MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.48ms. Allocated memory is still 184.5MB. Free memory was 128.6MB in the beginning and 152.0MB in the end (delta: -23.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.22ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 147.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.97ms. Allocated memory is still 184.5MB. Free memory was 147.8MB in the beginning and 141.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 501.43ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 112.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12510.24ms. Allocated memory was 184.5MB in the beginning and 415.2MB in the end (delta: 230.7MB). Free memory was 111.1MB in the beginning and 191.4MB in the end (delta: -80.3MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 415.2MB. Free memory is still 191.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] float var_1_28 = 3.5; [L44] signed short int var_1_29 = -8; [L45] signed char var_1_31 = -32; [L46] signed char var_1_32 = 2; [L47] signed long int var_1_34 = -4; [L48] double var_1_38 = 0.5; [L49] unsigned long int last_1_var_1_1 = 64; [L50] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_1 = var_1_1 [L175] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L142] var_1_7 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L151] var_1_12 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L54] signed long int stepLocal_1 = last_1_var_1_11; [L55] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L56] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L57] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L61] COND TRUE ((((var_1_7) < (var_1_13)) ? (var_1_7) : (var_1_13))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L62] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L78] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=-6442450945, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L79] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=-6442450945, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L79] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L80] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L91] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L93] COND TRUE (~ (5 + var_1_12)) >= 10000u [L94] var_1_29 = (((((var_1_1 + var_1_12)) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? ((var_1_1 + var_1_12)) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L98] EXPR var_1_12 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L98] EXPR ((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L98] EXPR var_1_12 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L98] EXPR ((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L98] COND FALSE !(var_1_11 <= ((((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5))))) [L103] var_1_38 = var_1_22 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L104] COND FALSE !(! (var_1_11 >= var_1_11)) [L111] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L113] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L118] COND FALSE !((~ (var_1_5 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L121] COND FALSE !(\read(var_1_10)) [L124] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L126] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L127] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L130] COND FALSE !(var_1_12 > var_1_12) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L133] var_1_31 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-6442450945, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L178] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L178-L179] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-6442450945, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2060 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2040 mSDsluCounter, 4020 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2557 mSDsCounter, 609 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2660 IncrementalHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 609 mSolverCounterUnsat, 1463 mSDtfsCounter, 2660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 687 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2707 NumberOfCodeBlocks, 2707 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2845 ConstructedInterpolants, 0 QuantifiedInterpolants, 8513 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 16248/16632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 20:49:05,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.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 f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:49:06,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:49:06,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 20:49:06,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:49:06,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:49:06,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:49:06,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:49:06,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:49:06,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:49:06,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:49:06,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:49:06,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:49:06,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:49:06,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:49:06,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:49:06,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:49:06,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:49:06,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:49:06,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:49:06,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:49:06,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:49:06,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:49:06,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:49:06,947 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 20:49:06,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 20:49:06,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:49:06,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 20:49:06,948 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:49:06,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:49:06,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:49:06,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:49:06,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:49:06,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:49:06,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:49:06,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:49:06,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:49:06,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:49:06,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:49:06,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 20:49:06,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 20:49:06,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:49:06,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:49:06,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:49:06,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:49:06,955 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 -> f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 [2024-11-18 20:49:07,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:49:07,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:49:07,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:49:07,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:49:07,227 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:49:07,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-11-18 20:49:08,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:49:08,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:49:08,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-11-18 20:49:08,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228bc9113/5343e38abac148bd9b25908506cfb5f8/FLAGa08e39e51 [2024-11-18 20:49:08,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228bc9113/5343e38abac148bd9b25908506cfb5f8 [2024-11-18 20:49:08,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:49:08,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:49:08,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:49:08,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:49:08,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:49:08,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:08" (1/1) ... [2024-11-18 20:49:08,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9930c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:08, skipping insertion in model container [2024-11-18 20:49:08,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:08" (1/1) ... [2024-11-18 20:49:08,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:49:08,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-11-18 20:49:09,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:49:09,022 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:49:09,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-11-18 20:49:09,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:49:09,095 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:49:09,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09 WrapperNode [2024-11-18 20:49:09,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:49:09,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:49:09,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:49:09,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:49:09,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,146 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-18 20:49:09,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:49:09,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:49:09,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:49:09,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:49:09,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,182 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:49:09,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:49:09,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:49:09,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:49:09,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:49:09,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (1/1) ... [2024-11-18 20:49:09,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:49:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:49:09,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 20:49:09,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 20:49:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:49:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 20:49:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:49:09,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:49:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:49:09,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:49:09,369 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:49:09,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:49:11,088 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-18 20:49:11,089 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:49:11,099 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:49:11,099 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:49:11,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:11 BoogieIcfgContainer [2024-11-18 20:49:11,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:49:11,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:49:11,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:49:11,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:49:11,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:49:08" (1/3) ... [2024-11-18 20:49:11,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6fd496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:11, skipping insertion in model container [2024-11-18 20:49:11,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:09" (2/3) ... [2024-11-18 20:49:11,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6fd496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:11, skipping insertion in model container [2024-11-18 20:49:11,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:11" (3/3) ... [2024-11-18 20:49:11,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-11-18 20:49:11,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:49:11,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:49:11,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:49:11,177 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;@29332d33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:49:11,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:49:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 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-11-18 20:49:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 20:49:11,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:11,193 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-11-18 20:49:11,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2126712827, now seen corresponding path program 1 times [2024-11-18 20:49:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:49:11,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833640725] [2024-11-18 20:49:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:49:11,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:49:11,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 20:49:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:11,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:49:11,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:49:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-18 20:49:11,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:49:11,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:49:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833640725] [2024-11-18 20:49:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833640725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:49:11,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:49:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 20:49:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488436310] [2024-11-18 20:49:11,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:49:11,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:49:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:49:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:49:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:49:11,656 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-11-18 20:49:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:11,688 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2024-11-18 20:49:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:49:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 149 [2024-11-18 20:49:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:11,698 INFO L225 Difference]: With dead ends: 153 [2024-11-18 20:49:11,698 INFO L226 Difference]: Without dead ends: 75 [2024-11-18 20:49:11,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:49:11,704 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:11,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:49:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-18 20:49:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-18 20:49:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 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-11-18 20:49:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-18 20:49:11,735 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 149 [2024-11-18 20:49:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:11,735 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-18 20:49:11,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-11-18 20:49:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-18 20:49:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 20:49:11,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:11,738 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-11-18 20:49:11,750 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-11-18 20:49:11,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:11,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:11,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2088252533, now seen corresponding path program 1 times [2024-11-18 20:49:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:49:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019687476] [2024-11-18 20:49:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:11,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:49:11,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:49:11,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 20:49:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:12,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 20:49:12,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:49:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 20:49:13,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:49:13,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:49:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019687476] [2024-11-18 20:49:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019687476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:49:13,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:49:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:49:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685519139] [2024-11-18 20:49:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:49:13,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:49:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:49:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:49:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:49:13,214 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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-11-18 20:49:14,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:16,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:16,259 INFO L93 Difference]: Finished difference Result 220 states and 331 transitions. [2024-11-18 20:49:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:49:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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-11-18 20:49:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:16,282 INFO L225 Difference]: With dead ends: 220 [2024-11-18 20:49:16,282 INFO L226 Difference]: Without dead ends: 148 [2024-11-18 20:49:16,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:49:16,284 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 85 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:16,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 341 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-18 20:49:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-18 20:49:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2024-11-18 20:49:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 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-11-18 20:49:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2024-11-18 20:49:16,304 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 149 [2024-11-18 20:49:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:16,305 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2024-11-18 20:49:16,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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-11-18 20:49:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2024-11-18 20:49:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 20:49:16,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:16,307 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-11-18 20:49:16,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 20:49:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:16,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:16,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -361234611, now seen corresponding path program 1 times [2024-11-18 20:49:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:49:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103447761] [2024-11-18 20:49:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:16,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:16,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:49:16,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:49:16,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 20:49:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:16,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 20:49:16,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:49:17,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-11-18 20:49:17,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:49:17,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:49:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103447761] [2024-11-18 20:49:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103447761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:49:17,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:49:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:49:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061618619] [2024-11-18 20:49:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:49:17,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:49:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:49:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:49:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:49:17,524 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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-11-18 20:49:19,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:20,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:20,291 INFO L93 Difference]: Finished difference Result 220 states and 330 transitions. [2024-11-18 20:49:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:49:20,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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-11-18 20:49:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:20,313 INFO L225 Difference]: With dead ends: 220 [2024-11-18 20:49:20,313 INFO L226 Difference]: Without dead ends: 148 [2024-11-18 20:49:20,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:49:20,317 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:20,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 342 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-18 20:49:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-18 20:49:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2024-11-18 20:49:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 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-11-18 20:49:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2024-11-18 20:49:20,339 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 150 [2024-11-18 20:49:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:20,339 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-18 20:49:20,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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-11-18 20:49:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2024-11-18 20:49:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 20:49:20,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:20,345 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-11-18 20:49:20,360 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-11-18 20:49:20,545 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-11-18 20:49:20,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1178883061, now seen corresponding path program 1 times [2024-11-18 20:49:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:49:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965414309] [2024-11-18 20:49:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:20,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:20,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:49:20,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:49:20,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 20:49:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:20,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 20:49:20,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:49:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-18 20:49:21,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:49:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:49:21,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:49:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965414309] [2024-11-18 20:49:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965414309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:49:21,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 20:49:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-18 20:49:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083853127] [2024-11-18 20:49:21,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 20:49:21,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 20:49:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:49:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 20:49:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:49:21,334 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-18 20:49:22,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:23,054 INFO L93 Difference]: Finished difference Result 206 states and 298 transitions. [2024-11-18 20:49:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:49:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 150 [2024-11-18 20:49:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:23,057 INFO L225 Difference]: With dead ends: 206 [2024-11-18 20:49:23,057 INFO L226 Difference]: Without dead ends: 134 [2024-11-18 20:49:23,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:49:23,058 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:23,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 189 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-18 20:49:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-18 20:49:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2024-11-18 20:49:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 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-11-18 20:49:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2024-11-18 20:49:23,074 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 150 [2024-11-18 20:49:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2024-11-18 20:49:23,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-18 20:49:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2024-11-18 20:49:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 20:49:23,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:23,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:49:23,093 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-11-18 20:49:23,276 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-11-18 20:49:23,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:23,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash -498824691, now seen corresponding path program 1 times [2024-11-18 20:49:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:49:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136199802] [2024-11-18 20:49:23,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:23,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:23,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:49:23,280 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-11-18 20:49:23,280 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-11-18 20:49:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:23,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 20:49:23,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:49:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-18 20:49:24,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:49:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-18 20:49:24,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:49:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136199802] [2024-11-18 20:49:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136199802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:49:24,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 20:49:24,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-18 20:49:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499519156] [2024-11-18 20:49:24,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 20:49:24,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 20:49:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:49:24,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 20:49:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-18 20:49:24,531 INFO L87 Difference]: Start difference. First operand 126 states and 179 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-18 20:49:26,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:28,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 20:49:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:49:29,096 INFO L93 Difference]: Finished difference Result 271 states and 363 transitions. [2024-11-18 20:49:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 20:49:29,097 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2024-11-18 20:49:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:49:29,098 INFO L225 Difference]: With dead ends: 271 [2024-11-18 20:49:29,099 INFO L226 Difference]: Without dead ends: 196 [2024-11-18 20:49:29,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-11-18 20:49:29,107 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 167 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:49:29,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 417 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-18 20:49:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-18 20:49:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2024-11-18 20:49:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 112 states have (on average 1.125) internal successors, (126), 113 states have internal predecessors, (126), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-18 20:49:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2024-11-18 20:49:29,125 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 150 [2024-11-18 20:49:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:49:29,125 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2024-11-18 20:49:29,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-18 20:49:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2024-11-18 20:49:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 20:49:29,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:49:29,127 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-11-18 20:49:29,143 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-11-18 20:49:29,328 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-11-18 20:49:29,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:49:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:49:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1276182671, now seen corresponding path program 1 times [2024-11-18 20:49:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:49:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614904236] [2024-11-18 20:49:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:49:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:49:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:49:29,330 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-11-18 20:49:29,331 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-11-18 20:49:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:49:29,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-18 20:49:29,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:50:01,368 WARN L286 SmtUtils]: Spent 10.92s 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)