./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_loopvsstraightlinecode_50-1loop_file-35.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 fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:41:06,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:41:06,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:41:06,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:41:06,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:41:06,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:41:06,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:41:06,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:41:06,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:41:06,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:41:06,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:41:06,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:41:06,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:41:06,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:41:06,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:41:06,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:41:06,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:41:06,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:41:06,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:41:06,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:41:06,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:41:06,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:41:06,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:41:06,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:41:06,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:41:06,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:41:06,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:41:06,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:41:06,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:41:06,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:41:06,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:41:06,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:41:06,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:41:06,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:41:06,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:41:06,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:41:06,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:41:06,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:41:06,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:41:06,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:41:06,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:41:06,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:41:06,932 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 -> fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c [2024-11-12 05:41:07,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:41:07,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:41:07,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:41:07,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:41:07,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:41:07,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-12 05:41:08,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:41:08,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:41:08,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-12 05:41:08,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72873f56a/ddad1d865e4a4830b6257bbb145bb0b3/FLAG912d5bd54 [2024-11-12 05:41:08,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72873f56a/ddad1d865e4a4830b6257bbb145bb0b3 [2024-11-12 05:41:08,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:41:08,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:41:08,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:41:08,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:41:08,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:41:08,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:08,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bdd4a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08, skipping insertion in model container [2024-11-12 05:41:08,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:08,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:41:08,813 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_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-12 05:41:08,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:41:08,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:41:08,897 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_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-12 05:41:08,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:41:08,940 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:41:08,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08 WrapperNode [2024-11-12 05:41:08,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:41:08,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:41:08,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:41:08,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:41:08,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:08,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:08,978 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-12 05:41:08,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:41:08,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:41:08,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:41:08,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:41:08,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:08,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:08,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,002 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-12 05:41:09,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:41:09,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:41:09,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:41:09,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:41:09,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (1/1) ... [2024-11-12 05:41:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:41:09,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:41:09,048 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-12 05:41:09,051 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-12 05:41:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:41:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:41:09,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:41:09,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:41:09,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:41:09,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:41:09,168 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:41:09,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:41:09,413 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 05:41:09,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:41:09,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:41:09,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:41:09,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:09 BoogieIcfgContainer [2024-11-12 05:41:09,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:41:09,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:41:09,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:41:09,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:41:09,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:41:08" (1/3) ... [2024-11-12 05:41:09,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d6c37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:41:09, skipping insertion in model container [2024-11-12 05:41:09,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:08" (2/3) ... [2024-11-12 05:41:09,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d6c37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:41:09, skipping insertion in model container [2024-11-12 05:41:09,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:09" (3/3) ... [2024-11-12 05:41:09,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-12 05:41:09,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:41:09,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:41:09,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:41:09,496 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;@63ce0dbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:41:09,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:41:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:41:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 05:41:09,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:09,513 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:09,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:09,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1458093889, now seen corresponding path program 1 times [2024-11-12 05:41:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:41:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459848234] [2024-11-12 05:41:09,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:41:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:41:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:41:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:41:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:41:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:41:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:41:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:41:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:41:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:41:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:41:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:41:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:41:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 05:41:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 05:41:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 05:41:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 05:41:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 05:41:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 05:41:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 05:41:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 05:41:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:09,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:41:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459848234] [2024-11-12 05:41:09,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459848234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:09,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:41:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72772693] [2024-11-12 05:41:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:41:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:41:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:41:09,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:41:09,899 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:41:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:09,921 INFO L93 Difference]: Finished difference Result 143 states and 231 transitions. [2024-11-12 05:41:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:41:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-12 05:41:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:09,928 INFO L225 Difference]: With dead ends: 143 [2024-11-12 05:41:09,929 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 05:41:09,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:41:09,936 INFO L435 NwaCegarLoop]: 104 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, 104 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-12 05:41:09,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:41:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 05:41:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 05:41:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:41:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2024-11-12 05:41:10,026 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 136 [2024-11-12 05:41:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:10,027 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2024-11-12 05:41:10,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:41:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2024-11-12 05:41:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 05:41:10,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:10,032 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:10,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:41:10,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:10,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 845608135, now seen corresponding path program 1 times [2024-11-12 05:41:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:41:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23414618] [2024-11-12 05:41:10,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:41:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:41:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:41:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:41:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:41:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:41:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:41:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:41:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:41:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:41:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:41:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:41:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:41:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 05:41:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 05:41:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 05:41:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 05:41:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 05:41:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 05:41:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 05:41:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 05:41:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:41:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23414618] [2024-11-12 05:41:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23414618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:10,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:10,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:41:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379090870] [2024-11-12 05:41:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:10,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:41:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:41:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:41:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:41:10,493 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:10,667 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-12 05:41:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:41:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-12 05:41:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:10,671 INFO L225 Difference]: With dead ends: 222 [2024-11-12 05:41:10,671 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 05:41:10,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:41:10,674 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 95 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:10,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 374 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:41:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 05:41:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2024-11-12 05:41:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 05:41:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2024-11-12 05:41:10,698 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 136 [2024-11-12 05:41:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:10,699 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2024-11-12 05:41:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2024-11-12 05:41:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 05:41:10,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:10,704 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:10,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:41:10,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:10,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1373937002, now seen corresponding path program 1 times [2024-11-12 05:41:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:41:10,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694686792] [2024-11-12 05:41:10,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:41:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:41:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:41:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:41:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:41:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:41:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:41:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:41:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:41:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:41:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:41:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:41:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:41:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 05:41:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 05:41:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 05:41:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 05:41:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 05:41:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 05:41:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 05:41:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 05:41:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:41:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694686792] [2024-11-12 05:41:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694686792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:10,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:41:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872511827] [2024-11-12 05:41:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:10,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:41:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:41:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:41:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:41:10,948 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:11,119 INFO L93 Difference]: Finished difference Result 460 states and 672 transitions. [2024-11-12 05:41:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:41:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-12 05:41:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:11,125 INFO L225 Difference]: With dead ends: 460 [2024-11-12 05:41:11,125 INFO L226 Difference]: Without dead ends: 330 [2024-11-12 05:41:11,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-12 05:41:11,127 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 134 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:11,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 376 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:41:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-12 05:41:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 224. [2024-11-12 05:41:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.3212121212121213) internal successors, (218), 167 states have internal predecessors, (218), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 05:41:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2024-11-12 05:41:11,172 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 137 [2024-11-12 05:41:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:11,173 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2024-11-12 05:41:11,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2024-11-12 05:41:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 05:41:11,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:11,176 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:11,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:41:11,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:11,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1960743016, now seen corresponding path program 1 times [2024-11-12 05:41:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:41:11,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183978030] [2024-11-12 05:41:11,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:41:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:41:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:41:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:41:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:41:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:41:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:41:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:41:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:41:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:41:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:41:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:41:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:41:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 05:41:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 05:41:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 05:41:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 05:41:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 05:41:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 05:41:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 05:41:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 05:41:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:41:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183978030] [2024-11-12 05:41:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183978030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:41:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107736358] [2024-11-12 05:41:11,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:41:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:41:11,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:41:11,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:41:11,462 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:11,569 INFO L93 Difference]: Finished difference Result 736 states and 1067 transitions. [2024-11-12 05:41:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:41:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-12 05:41:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:11,577 INFO L225 Difference]: With dead ends: 736 [2024-11-12 05:41:11,577 INFO L226 Difference]: Without dead ends: 515 [2024-11-12 05:41:11,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:41:11,580 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 98 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:11,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 301 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:41:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-12 05:41:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 443. [2024-11-12 05:41:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 326 states have (on average 1.3190184049079754) internal successors, (430), 330 states have internal predecessors, (430), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 05:41:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 646 transitions. [2024-11-12 05:41:11,635 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 646 transitions. Word has length 137 [2024-11-12 05:41:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:11,637 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 646 transitions. [2024-11-12 05:41:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 646 transitions. [2024-11-12 05:41:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 05:41:11,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:11,640 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:11,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:41:11,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:11,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash 645280538, now seen corresponding path program 1 times [2024-11-12 05:41:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:41:11,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230810916] [2024-11-12 05:41:11,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:41:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:41:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:41:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:41:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:41:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:41:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:41:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:41:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:41:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:41:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:41:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:41:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:41:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 05:41:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 05:41:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 05:41:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 05:41:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 05:41:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 05:41:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 05:41:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 05:41:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:41:11,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230810916] [2024-11-12 05:41:11,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230810916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:11,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:11,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:41:11,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156409079] [2024-11-12 05:41:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:41:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:41:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:41:11,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:41:11,858 INFO L87 Difference]: Start difference. First operand 443 states and 646 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:12,064 INFO L93 Difference]: Finished difference Result 856 states and 1215 transitions. [2024-11-12 05:41:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:41:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-12 05:41:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:12,068 INFO L225 Difference]: With dead ends: 856 [2024-11-12 05:41:12,068 INFO L226 Difference]: Without dead ends: 635 [2024-11-12 05:41:12,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:41:12,069 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 110 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:12,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 371 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:41:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-12 05:41:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 443. [2024-11-12 05:41:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 330 states have internal predecessors, (426), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 05:41:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 642 transitions. [2024-11-12 05:41:12,107 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 642 transitions. Word has length 137 [2024-11-12 05:41:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:12,107 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 642 transitions. [2024-11-12 05:41:12,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 642 transitions. [2024-11-12 05:41:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 05:41:12,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:12,109 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:12,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:41:12,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:12,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1325338908, now seen corresponding path program 1 times [2024-11-12 05:41:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:41:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879037503] [2024-11-12 05:41:12,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:41:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:41:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558598279] [2024-11-12 05:41:12,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:12,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:41:12,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:41:12,158 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-12 05:41:12,159 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-12 05:41:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:41:12,272 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:41:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:41:12,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:41:12,359 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:41:12,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:41:12,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:41:12,565 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,SelfDestructingSolverStorable5 [2024-11-12 05:41:12,568 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 05:41:12,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:41:12,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:41:12 BoogieIcfgContainer [2024-11-12 05:41:12,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:41:12,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:41:12,656 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:41:12,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:41:12,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:09" (3/4) ... [2024-11-12 05:41:12,658 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:41:12,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:41:12,659 INFO L158 Benchmark]: Toolchain (without parser) took 4043.03ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 92.1MB in the beginning and 84.2MB in the end (delta: 8.0MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2024-11-12 05:41:12,659 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:41:12,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.93ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 133.4MB in the end (delta: -41.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-12 05:41:12,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.06ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 130.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:41:12,660 INFO L158 Benchmark]: Boogie Preprocessor took 42.03ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 127.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:41:12,660 INFO L158 Benchmark]: RCFGBuilder took 400.85ms. Allocated memory is still 167.8MB. Free memory was 127.1MB in the beginning and 105.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 05:41:12,660 INFO L158 Benchmark]: TraceAbstraction took 3229.32ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 104.1MB in the beginning and 85.2MB in the end (delta: 18.8MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2024-11-12 05:41:12,661 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 234.9MB. Free memory was 85.2MB in the beginning and 84.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:41:12,662 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.15ms. Allocated memory is still 167.8MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.93ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 133.4MB in the end (delta: -41.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.06ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 130.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.03ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 127.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 400.85ms. Allocated memory is still 167.8MB. Free memory was 127.1MB in the beginning and 105.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3229.32ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 104.1MB in the beginning and 85.2MB in the end (delta: 18.8MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 234.9MB. Free memory was 85.2MB in the beginning and 84.2MB in the end (delta: 1.0MB). 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 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someUnaryFLOAToperation at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] signed short int last_1_var_1_12 = 2; [L44] signed long int last_1_var_1_13 = -256; [L45] double last_1_var_1_14 = 127.75; [L46] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_14 = var_1_14 [L130] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L141] RET updateLastVariables() [L142] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L97] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L97] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L100] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L100] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L101] var_1_9 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L102] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L104] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L106] var_1_15 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L107] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L108] var_1_17 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L109] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L110] var_1_18 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L112] var_1_19 = __VERIFIER_nondet_float() [L113] 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L113] 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L114] var_1_20 = __VERIFIER_nondet_float() [L115] 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L115] 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L116] var_1_22 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L117] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L118] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L118] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L119] var_1_24 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L120] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L121] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L121] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L122] var_1_25 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L124] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L124] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L142] RET updateVariables() [L143] CALL step() [L50] COND FALSE !(\read(last_1_var_1_21)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L55] COND TRUE var_1_18 > var_1_9 [L56] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L60] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L61] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L62] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L63] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L70] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L71] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L74] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L74] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L75] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L79] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L80] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L81] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L84] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L85] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L143] RET step() [L144] CALL, EXPR property() [L133] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L133-L134] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 1526 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 635 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 393 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 1182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3800/3800 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-12 05:41:12,685 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_loopvsstraightlinecode_50-1loop_file-35.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 fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:41:14,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:41:14,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:41:14,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:41:14,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:41:14,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:41:14,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:41:14,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:41:14,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:41:14,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:41:14,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:41:14,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:41:14,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:41:14,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:41:14,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:41:14,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:41:14,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:41:14,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:41:14,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:41:14,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:41:14,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:41:14,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:41:14,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:41:14,619 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:41:14,619 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:41:14,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:41:14,620 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:41:14,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:41:14,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:41:14,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:41:14,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:41:14,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:41:14,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:41:14,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:41:14,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:41:14,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:41:14,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:41:14,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:41:14,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 -> fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c [2024-11-12 05:41:14,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:41:14,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:41:14,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:41:14,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:41:14,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:41:14,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-12 05:41:16,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:41:16,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:41:16,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-12 05:41:16,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fda487ef/557d89562d074d85b2ec6f1167d3c0c9/FLAGc7612d81e [2024-11-12 05:41:16,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fda487ef/557d89562d074d85b2ec6f1167d3c0c9 [2024-11-12 05:41:16,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:41:16,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:41:16,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:41:16,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:41:16,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:41:16,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b68060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16, skipping insertion in model container [2024-11-12 05:41:16,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:41:16,517 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_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-12 05:41:16,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:41:16,593 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:41:16,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-12 05:41:16,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:41:16,649 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:41:16,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16 WrapperNode [2024-11-12 05:41:16,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:41:16,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:41:16,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:41:16,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:41:16,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,703 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-12 05:41:16,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:41:16,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:41:16,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:41:16,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:41:16,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,747 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-12 05:41:16,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:41:16,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:41:16,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:41:16,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:41:16,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (1/1) ... [2024-11-12 05:41:16,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:41:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:41:16,802 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-12 05:41:16,803 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-12 05:41:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:41:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:41:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:41:16,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:41:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:41:16,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:41:16,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:41:16,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:41:18,681 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 05:41:18,682 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:41:18,694 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:41:18,695 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:41:18,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:18 BoogieIcfgContainer [2024-11-12 05:41:18,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:41:18,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:41:18,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:41:18,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:41:18,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:41:16" (1/3) ... [2024-11-12 05:41:18,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b018b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:41:18, skipping insertion in model container [2024-11-12 05:41:18,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:41:16" (2/3) ... [2024-11-12 05:41:18,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b018b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:41:18, skipping insertion in model container [2024-11-12 05:41:18,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:18" (3/3) ... [2024-11-12 05:41:18,701 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-12 05:41:18,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:41:18,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:41:18,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:41:18,778 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;@7565f0dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:41:18,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:41:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:41:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 05:41:18,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:18,792 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:18,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:18,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1599895908, now seen corresponding path program 1 times [2024-11-12 05:41:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:18,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754992678] [2024-11-12 05:41:18,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:18,807 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-12 05:41:18,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:18,809 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-12 05:41:18,810 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-12 05:41:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:19,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:41:19,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:41:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-12 05:41:19,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:41:19,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:41:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754992678] [2024-11-12 05:41:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754992678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:19,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:41:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097399497] [2024-11-12 05:41:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:19,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:41:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:41:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:41:19,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:41:19,267 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:41:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:19,288 INFO L93 Difference]: Finished difference Result 129 states and 211 transitions. [2024-11-12 05:41:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:41:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-11-12 05:41:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:19,296 INFO L225 Difference]: With dead ends: 129 [2024-11-12 05:41:19,296 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 05:41:19,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-12 05:41:19,302 INFO L435 NwaCegarLoop]: 94 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, 94 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-12 05:41:19,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:41:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 05:41:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-12 05:41:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:41:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-12 05:41:19,333 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 133 [2024-11-12 05:41:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:19,334 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-12 05:41:19,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:41:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-12 05:41:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 05:41:19,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:19,338 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:19,347 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-12 05:41:19,538 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-12 05:41:19,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1134592604, now seen corresponding path program 1 times [2024-11-12 05:41:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669534328] [2024-11-12 05:41:19,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:19,541 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-12 05:41:19,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:19,542 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-12 05:41:19,543 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-12 05:41:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:19,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 05:41:19,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:41:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:20,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:41:20,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:41:20,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669534328] [2024-11-12 05:41:20,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669534328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:20,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:41:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167715986] [2024-11-12 05:41:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:41:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:41:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:41:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:41:20,145 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:25,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:26,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:27,006 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2024-11-12 05:41:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:41:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 05:41:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:27,010 INFO L225 Difference]: With dead ends: 200 [2024-11-12 05:41:27,010 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 05:41:27,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:41:27,013 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:27,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 279 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2024-11-12 05:41:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 05:41:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2024-11-12 05:41:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 05:41:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-11-12 05:41:27,042 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 133 [2024-11-12 05:41:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:27,043 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-11-12 05:41:27,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-11-12 05:41:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 05:41:27,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:27,044 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:27,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:41:27,247 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-12 05:41:27,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash -145271074, now seen corresponding path program 1 times [2024-11-12 05:41:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:27,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271989986] [2024-11-12 05:41:27,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:27,249 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-12 05:41:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:27,250 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-12 05:41:27,251 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-12 05:41:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:27,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:41:27,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:41:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:27,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:41:27,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:41:27,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271989986] [2024-11-12 05:41:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271989986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:27,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:41:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631810751] [2024-11-12 05:41:27,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:27,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:41:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:41:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:41:27,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:41:27,831 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:30,067 INFO L93 Difference]: Finished difference Result 377 states and 554 transitions. [2024-11-12 05:41:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:41:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 05:41:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:30,087 INFO L225 Difference]: With dead ends: 377 [2024-11-12 05:41:30,088 INFO L226 Difference]: Without dead ends: 261 [2024-11-12 05:41:30,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:41:30,089 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:30,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 317 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 05:41:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-12 05:41:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2024-11-12 05:41:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 148 states have internal predecessors, (184), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 05:41:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 344 transitions. [2024-11-12 05:41:30,128 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 344 transitions. Word has length 133 [2024-11-12 05:41:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 344 transitions. [2024-11-12 05:41:30,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2024-11-12 05:41:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 05:41:30,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:30,131 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:30,142 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-12 05:41:30,331 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-12 05:41:30,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1644718843, now seen corresponding path program 1 times [2024-11-12 05:41:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095139317] [2024-11-12 05:41:30,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:30,333 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-12 05:41:30,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:30,336 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-12 05:41:30,337 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-12 05:41:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:30,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 05:41:30,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:41:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:41:30,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:41:30,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:41:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095139317] [2024-11-12 05:41:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095139317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 05:41:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480772747] [2024-11-12 05:41:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:30,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:41:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:41:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:41:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:41:30,668 INFO L87 Difference]: Start difference. First operand 233 states and 344 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:34,963 INFO L93 Difference]: Finished difference Result 580 states and 851 transitions. [2024-11-12 05:41:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:41:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-12 05:41:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:34,977 INFO L225 Difference]: With dead ends: 580 [2024-11-12 05:41:34,979 INFO L226 Difference]: Without dead ends: 521 [2024-11-12 05:41:34,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 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-12 05:41:34,982 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 120 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:34,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 508 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-12 05:41:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-12 05:41:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 295. [2024-11-12 05:41:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 194 states have (on average 1.2474226804123711) internal successors, (242), 196 states have internal predecessors, (242), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-12 05:41:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 430 transitions. [2024-11-12 05:41:35,053 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 430 transitions. Word has length 134 [2024-11-12 05:41:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 430 transitions. [2024-11-12 05:41:35,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:41:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 430 transitions. [2024-11-12 05:41:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 05:41:35,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:35,056 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:35,069 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-12 05:41:35,256 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-12 05:41:35,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash -875241091, now seen corresponding path program 1 times [2024-11-12 05:41:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550434202] [2024-11-12 05:41:35,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:35,258 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-12 05:41:35,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:35,261 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-12 05:41:35,262 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-12 05:41:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:35,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 05:41:35,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:42:33,026 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)