./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:30:23,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:30:24,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:30:24,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:30:24,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:30:24,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:30:24,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:30:24,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:30:24,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:30:24,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:30:24,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:30:24,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:30:24,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:30:24,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:30:24,064 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:30:24,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:30:24,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:30:24,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:30:24,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:30:24,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:30:24,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:30:24,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:30:24,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:30:24,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:30:24,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:30:24,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:30:24,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:30:24,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:30:24,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:30:24,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:30:24,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:30:24,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:30:24,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:24,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:30:24,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:30:24,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:30:24,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:30:24,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:30:24,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:30:24,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:30:24,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:30:24,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:30:24,078 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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2024-10-13 02:30:24,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:30:24,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:30:24,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:30:24,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:30:24,414 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:30:24,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-10-13 02:30:26,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:30:26,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:30:26,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-10-13 02:30:26,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b15ea6/b8dbd40925d34fb4b2d7855b3eb1fa3f/FLAGc2f35328b [2024-10-13 02:30:26,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b15ea6/b8dbd40925d34fb4b2d7855b3eb1fa3f [2024-10-13 02:30:26,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:30:26,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:30:26,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:26,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:30:26,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:30:26,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48093155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26, skipping insertion in model container [2024-10-13 02:30:26,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:30:26,538 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-10-13 02:30:26,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:26,637 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:30:26,648 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-10-13 02:30:26,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:26,729 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:30:26,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26 WrapperNode [2024-10-13 02:30:26,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:26,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:26,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:30:26,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:30:26,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,800 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-10-13 02:30:26,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:26,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:30:26,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:30:26,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:30:26,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:30:26,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:30:26,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:30:26,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:30:26,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:30:26,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (1/1) ... [2024-10-13 02:30:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:26,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:26,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:30:26,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:30:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:30:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:30:26,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:30:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:30:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:30:26,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:30:27,071 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:30:27,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:30:27,629 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 02:30:27,631 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:30:27,680 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:30:27,681 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:30:27,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:27 BoogieIcfgContainer [2024-10-13 02:30:27,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:30:27,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:30:27,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:30:27,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:30:27,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:30:26" (1/3) ... [2024-10-13 02:30:27,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212c8242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:30:27, skipping insertion in model container [2024-10-13 02:30:27,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:26" (2/3) ... [2024-10-13 02:30:27,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212c8242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:30:27, skipping insertion in model container [2024-10-13 02:30:27,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:27" (3/3) ... [2024-10-13 02:30:27,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-10-13 02:30:27,707 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:30:27,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:30:27,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:30:27,777 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;@6284fb85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:30:27,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:30:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 71 states have internal predecessors, (110), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:30:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:30:27,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:27,797 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:27,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:27,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash -767010008, now seen corresponding path program 1 times [2024-10-13 02:30:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775150441] [2024-10-13 02:30:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:28,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775150441] [2024-10-13 02:30:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775150441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:28,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:28,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:30:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578465947] [2024-10-13 02:30:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:28,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:30:28,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:28,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:30:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:30:28,359 INFO L87 Difference]: Start difference. First operand has 102 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 71 states have internal predecessors, (110), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:30:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:28,412 INFO L93 Difference]: Finished difference Result 201 states and 363 transitions. [2024-10-13 02:30:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:30:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-10-13 02:30:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:28,424 INFO L225 Difference]: With dead ends: 201 [2024-10-13 02:30:28,424 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 02:30:28,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:30:28,434 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:28,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:30:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 02:30:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 02:30:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 69 states have internal predecessors, (105), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:30:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 163 transitions. [2024-10-13 02:30:28,498 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 163 transitions. Word has length 185 [2024-10-13 02:30:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:28,499 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 163 transitions. [2024-10-13 02:30:28,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:30:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2024-10-13 02:30:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:30:28,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:28,507 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:28,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:30:28,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2046687710, now seen corresponding path program 1 times [2024-10-13 02:30:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:28,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337138681] [2024-10-13 02:30:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337138681] [2024-10-13 02:30:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337138681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:29,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:29,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:29,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411462236] [2024-10-13 02:30:29,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:30:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:29,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:30:29,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:29,152 INFO L87 Difference]: Start difference. First operand 100 states and 163 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:29,267 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2024-10-13 02:30:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:30:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-13 02:30:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:29,275 INFO L225 Difference]: With dead ends: 298 [2024-10-13 02:30:29,277 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 02:30:29,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:29,279 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 96 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:29,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 290 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:30:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 02:30:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-10-13 02:30:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 135 states have (on average 1.511111111111111) internal successors, (204), 135 states have internal predecessors, (204), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 02:30:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2024-10-13 02:30:29,325 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 185 [2024-10-13 02:30:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:29,328 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2024-10-13 02:30:29,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2024-10-13 02:30:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:30:29,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:29,331 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:29,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:30:29,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:29,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash 283481472, now seen corresponding path program 1 times [2024-10-13 02:30:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767611046] [2024-10-13 02:30:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:29,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767611046] [2024-10-13 02:30:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767611046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:30:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723305083] [2024-10-13 02:30:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:30:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:30:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:30:29,793 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:29,940 INFO L93 Difference]: Finished difference Result 572 states and 938 transitions. [2024-10-13 02:30:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:30:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-13 02:30:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:29,948 INFO L225 Difference]: With dead ends: 572 [2024-10-13 02:30:29,950 INFO L226 Difference]: Without dead ends: 377 [2024-10-13 02:30:29,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:29,953 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 96 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:29,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 502 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:30:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-13 02:30:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2024-10-13 02:30:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 254 states have (on average 1.4803149606299213) internal successors, (376), 254 states have internal predecessors, (376), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-13 02:30:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 608 transitions. [2024-10-13 02:30:30,040 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 608 transitions. Word has length 185 [2024-10-13 02:30:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:30,042 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 608 transitions. [2024-10-13 02:30:30,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 608 transitions. [2024-10-13 02:30:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:30:30,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:30,048 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:30:30,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1980359641, now seen corresponding path program 1 times [2024-10-13 02:30:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399760544] [2024-10-13 02:30:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399760544] [2024-10-13 02:30:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399760544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:30:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372532149] [2024-10-13 02:30:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:30,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:30:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:30,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:30:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:30:30,529 INFO L87 Difference]: Start difference. First operand 375 states and 608 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:30,841 INFO L93 Difference]: Finished difference Result 840 states and 1358 transitions. [2024-10-13 02:30:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:30:30,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-13 02:30:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:30,850 INFO L225 Difference]: With dead ends: 840 [2024-10-13 02:30:30,850 INFO L226 Difference]: Without dead ends: 466 [2024-10-13 02:30:30,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:30,854 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:30,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 485 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:30:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-13 02:30:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2024-10-13 02:30:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 312 states have (on average 1.4647435897435896) internal successors, (457), 312 states have internal predecessors, (457), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-13 02:30:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 747 transitions. [2024-10-13 02:30:30,907 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 747 transitions. Word has length 187 [2024-10-13 02:30:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:30,907 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 747 transitions. [2024-10-13 02:30:30,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 747 transitions. [2024-10-13 02:30:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 02:30:30,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:30,910 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:30,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:30:30,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:30,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2093979346, now seen corresponding path program 1 times [2024-10-13 02:30:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41099522] [2024-10-13 02:30:30,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:30,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41099522] [2024-10-13 02:30:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41099522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115661539] [2024-10-13 02:30:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:31,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:30:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:30:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:31,116 INFO L87 Difference]: Start difference. First operand 463 states and 747 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:31,192 INFO L93 Difference]: Finished difference Result 1225 states and 1977 transitions. [2024-10-13 02:30:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:30:31,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-13 02:30:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:31,199 INFO L225 Difference]: With dead ends: 1225 [2024-10-13 02:30:31,199 INFO L226 Difference]: Without dead ends: 763 [2024-10-13 02:30:31,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:31,203 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 91 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:31,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 351 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:30:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-10-13 02:30:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 756. [2024-10-13 02:30:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 505 states have (on average 1.4653465346534653) internal successors, (740), 510 states have internal predecessors, (740), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2024-10-13 02:30:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1220 transitions. [2024-10-13 02:30:31,315 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1220 transitions. Word has length 190 [2024-10-13 02:30:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:31,316 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1220 transitions. [2024-10-13 02:30:31,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1220 transitions. [2024-10-13 02:30:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 02:30:31,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:31,319 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:31,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:30:31,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:31,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 684566166, now seen corresponding path program 1 times [2024-10-13 02:30:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:31,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405182200] [2024-10-13 02:30:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405182200] [2024-10-13 02:30:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405182200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644217194] [2024-10-13 02:30:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:31,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:30:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:31,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:30:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:31,657 INFO L87 Difference]: Start difference. First operand 756 states and 1220 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:31,768 INFO L93 Difference]: Finished difference Result 1511 states and 2439 transitions. [2024-10-13 02:30:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:30:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-10-13 02:30:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:31,778 INFO L225 Difference]: With dead ends: 1511 [2024-10-13 02:30:31,778 INFO L226 Difference]: Without dead ends: 756 [2024-10-13 02:30:31,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:31,782 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:31,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 158 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:30:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-13 02:30:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2024-10-13 02:30:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 505 states have (on average 1.4455445544554455) internal successors, (730), 510 states have internal predecessors, (730), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2024-10-13 02:30:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1210 transitions. [2024-10-13 02:30:31,886 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1210 transitions. Word has length 191 [2024-10-13 02:30:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:31,886 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1210 transitions. [2024-10-13 02:30:31,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1210 transitions. [2024-10-13 02:30:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 02:30:31,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:31,889 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:31,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:30:31,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:31,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 942731604, now seen corresponding path program 1 times [2024-10-13 02:30:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:31,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538280277] [2024-10-13 02:30:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538280277] [2024-10-13 02:30:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538280277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107745902] [2024-10-13 02:30:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:32,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:30:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:30:32,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:32,440 INFO L87 Difference]: Start difference. First operand 756 states and 1210 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:32,571 INFO L93 Difference]: Finished difference Result 1654 states and 2650 transitions. [2024-10-13 02:30:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:30:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-10-13 02:30:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:32,579 INFO L225 Difference]: With dead ends: 1654 [2024-10-13 02:30:32,579 INFO L226 Difference]: Without dead ends: 899 [2024-10-13 02:30:32,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:32,583 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 74 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:32,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 290 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:30:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-13 02:30:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 855. [2024-10-13 02:30:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 574 states have (on average 1.4442508710801394) internal successors, (829), 579 states have internal predecessors, (829), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-10-13 02:30:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1367 transitions. [2024-10-13 02:30:32,679 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1367 transitions. Word has length 191 [2024-10-13 02:30:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:32,680 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1367 transitions. [2024-10-13 02:30:32,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1367 transitions. [2024-10-13 02:30:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 02:30:32,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:32,683 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:30:32,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1829383295, now seen corresponding path program 1 times [2024-10-13 02:30:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638564299] [2024-10-13 02:30:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:33,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:33,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638564299] [2024-10-13 02:30:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638564299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:30:33,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080912015] [2024-10-13 02:30:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:33,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:30:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:30:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:30:33,080 INFO L87 Difference]: Start difference. First operand 855 states and 1367 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:33,337 INFO L93 Difference]: Finished difference Result 1628 states and 2608 transitions. [2024-10-13 02:30:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:30:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-10-13 02:30:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:33,345 INFO L225 Difference]: With dead ends: 1628 [2024-10-13 02:30:33,346 INFO L226 Difference]: Without dead ends: 857 [2024-10-13 02:30:33,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:30:33,350 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 91 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:33,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 782 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:30:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-13 02:30:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 855. [2024-10-13 02:30:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 574 states have (on average 1.4303135888501741) internal successors, (821), 579 states have internal predecessors, (821), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-10-13 02:30:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1359 transitions. [2024-10-13 02:30:33,444 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1359 transitions. Word has length 192 [2024-10-13 02:30:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1359 transitions. [2024-10-13 02:30:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1359 transitions. [2024-10-13 02:30:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 02:30:33,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:33,448 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:30:33,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 241035393, now seen corresponding path program 1 times [2024-10-13 02:30:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553611152] [2024-10-13 02:30:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:30:33,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553611152] [2024-10-13 02:30:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553611152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:30:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:30:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:30:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975693234] [2024-10-13 02:30:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:30:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:30:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:30:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:33,904 INFO L87 Difference]: Start difference. First operand 855 states and 1359 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:34,065 INFO L93 Difference]: Finished difference Result 1655 states and 2633 transitions. [2024-10-13 02:30:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:30:34,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-10-13 02:30:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:34,077 INFO L225 Difference]: With dead ends: 1655 [2024-10-13 02:30:34,078 INFO L226 Difference]: Without dead ends: 899 [2024-10-13 02:30:34,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:30:34,083 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 72 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:34,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 291 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:30:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-13 02:30:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 859. [2024-10-13 02:30:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 578 states have (on average 1.4273356401384083) internal successors, (825), 583 states have internal predecessors, (825), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-10-13 02:30:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1363 transitions. [2024-10-13 02:30:34,206 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1363 transitions. Word has length 192 [2024-10-13 02:30:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:34,207 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1363 transitions. [2024-10-13 02:30:34,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:30:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1363 transitions. [2024-10-13 02:30:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 02:30:34,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:34,211 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:34,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 02:30:34,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:34,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash 424241141, now seen corresponding path program 1 times [2024-10-13 02:30:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019130247] [2024-10-13 02:30:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 02:30:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:34,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019130247] [2024-10-13 02:30:34,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019130247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:30:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772981417] [2024-10-13 02:30:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:30:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:34,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:30:34,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:30:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:34,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:30:34,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:30:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-10-13 02:30:34,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:30:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 02:30:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772981417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:30:35,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:30:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 02:30:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824197322] [2024-10-13 02:30:35,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:30:35,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:30:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:30:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:30:35,216 INFO L87 Difference]: Start difference. First operand 859 states and 1363 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:30:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:35,611 INFO L93 Difference]: Finished difference Result 1728 states and 2692 transitions. [2024-10-13 02:30:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:30:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 193 [2024-10-13 02:30:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:35,620 INFO L225 Difference]: With dead ends: 1728 [2024-10-13 02:30:35,620 INFO L226 Difference]: Without dead ends: 927 [2024-10-13 02:30:35,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:30:35,624 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 103 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:35,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 374 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:30:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-10-13 02:30:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2024-10-13 02:30:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 611 states have (on average 1.3944353518821604) internal successors, (852), 616 states have internal predecessors, (852), 269 states have call successors, (269), 22 states have call predecessors, (269), 22 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-10-13 02:30:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1390 transitions. [2024-10-13 02:30:35,731 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1390 transitions. Word has length 193 [2024-10-13 02:30:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:35,734 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1390 transitions. [2024-10-13 02:30:35,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:30:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1390 transitions. [2024-10-13 02:30:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 02:30:35,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:35,737 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:35,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:30:35,937 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,SelfDestructingSolverStorable9 [2024-10-13 02:30:35,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:35,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash -194598465, now seen corresponding path program 1 times [2024-10-13 02:30:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:35,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502973655] [2024-10-13 02:30:35,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:30:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:30:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:30:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:30:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:30:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:30:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:30:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:30:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:30:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:30:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:30:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:30:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:30:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:30:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:30:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:30:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:30:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:30:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:30:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:30:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:30:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:30:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:30:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:30:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:30:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:30:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:30:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:30:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:30:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 81 proven. 219 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2024-10-13 02:30:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:30:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502973655] [2024-10-13 02:30:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502973655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:30:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717841935] [2024-10-13 02:30:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:37,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:30:37,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:37,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:30:37,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:30:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:30:37,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 02:30:37,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:30:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 1073 proven. 237 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 02:30:41,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:30:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 123 proven. 267 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2024-10-13 02:30:43,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717841935] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:30:43,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:30:43,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 21] total 49 [2024-10-13 02:30:43,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476411032] [2024-10-13 02:30:43,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:30:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-13 02:30:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:30:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-13 02:30:43,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=1837, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 02:30:43,872 INFO L87 Difference]: Start difference. First operand 903 states and 1390 transitions. Second operand has 49 states, 47 states have (on average 3.9574468085106385) internal successors, (186), 47 states have internal predecessors, (186), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) [2024-10-13 02:30:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:30:47,110 INFO L93 Difference]: Finished difference Result 1651 states and 2369 transitions. [2024-10-13 02:30:47,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-13 02:30:47,111 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 3.9574468085106385) internal successors, (186), 47 states have internal predecessors, (186), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) Word has length 194 [2024-10-13 02:30:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:30:47,117 INFO L225 Difference]: With dead ends: 1651 [2024-10-13 02:30:47,118 INFO L226 Difference]: Without dead ends: 805 [2024-10-13 02:30:47,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2119, Invalid=5363, Unknown=0, NotChecked=0, Total=7482 [2024-10-13 02:30:47,124 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 740 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:30:47,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 689 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 02:30:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-13 02:30:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 465. [2024-10-13 02:30:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 348 states have internal predecessors, (462), 91 states have call successors, (91), 27 states have call predecessors, (91), 27 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-13 02:30:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 644 transitions. [2024-10-13 02:30:47,187 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 644 transitions. Word has length 194 [2024-10-13 02:30:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:30:47,188 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 644 transitions. [2024-10-13 02:30:47,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 3.9574468085106385) internal successors, (186), 47 states have internal predecessors, (186), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) [2024-10-13 02:30:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 644 transitions. [2024-10-13 02:30:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 02:30:47,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:30:47,191 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:47,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:30:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 02:30:47,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:30:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:30:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash -194538883, now seen corresponding path program 1 times [2024-10-13 02:30:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:30:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454001651] [2024-10-13 02:30:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:30:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:30:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:30:47,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:30:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:30:47,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:30:47,646 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:30:47,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:30:47,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 02:30:47,654 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:30:47,810 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:30:47,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:30:47 BoogieIcfgContainer [2024-10-13 02:30:47,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:30:47,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:30:47,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:30:47,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:30:47,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:30:27" (3/4) ... [2024-10-13 02:30:47,819 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:30:47,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:30:47,821 INFO L158 Benchmark]: Toolchain (without parser) took 21519.39ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 112.2MB in the beginning and 190.9MB in the end (delta: -78.7MB). Peak memory consumption was 279.3MB. Max. memory is 16.1GB. [2024-10-13 02:30:47,821 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 130.9MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:30:47,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.91ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 94.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 02:30:47,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.48ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 90.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:30:47,822 INFO L158 Benchmark]: Boogie Preprocessor took 86.12ms. Allocated memory is still 167.8MB. Free memory was 90.1MB in the beginning and 84.3MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:30:47,822 INFO L158 Benchmark]: RCFGBuilder took 793.13ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 116.0MB in the end (delta: -31.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 02:30:47,823 INFO L158 Benchmark]: TraceAbstraction took 20131.78ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 115.7MB in the beginning and 190.9MB in the end (delta: -75.2MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. [2024-10-13 02:30:47,823 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 524.3MB. Free memory is still 190.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:30:47,825 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.28ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 130.9MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.91ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 94.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.48ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 90.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.12ms. Allocated memory is still 167.8MB. Free memory was 90.1MB in the beginning and 84.3MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 793.13ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 116.0MB in the end (delta: -31.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20131.78ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 115.7MB in the beginning and 190.9MB in the end (delta: -75.2MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 524.3MB. Free memory is still 190.9MB. 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 196, overapproximation of bitwiseAnd at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_29 = 32; [L44] unsigned long int var_1_32 = 2219578776; [L45] unsigned char var_1_34 = 0; [L46] unsigned char var_1_35 = 0; [L47] unsigned char var_1_36 = 5; [L48] float var_1_37 = 256.125; [L49] float var_1_38 = 127.25; [L50] unsigned char var_1_41 = 32; [L51] double var_1_42 = 16.125; [L52] double var_1_43 = 256.5; [L53] signed short int var_1_45 = -10; [L54] unsigned char last_1_var_1_1 = 2; [L55] unsigned char last_1_var_1_15 = 1; [L56] signed char last_1_var_1_20 = 0; [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_1 = var_1_1 [L192] last_1_var_1_15 = var_1_15 [L193] last_1_var_1_20 = var_1_20 [L203] RET updateLastVariables() [L204] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] var_1_5 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L149] var_1_6 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_8=32, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_8=32, var_1_9=201/2] [L154] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=32, var_1_9=201/2] [L154] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=32, var_1_9=201/2] [L155] var_1_8 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_9=201/2] [L156] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_9=201/2] [L157] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L158] var_1_11 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] var_1_12 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L161] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L164] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L164] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L165] var_1_17 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L166] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L167] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] var_1_19 = __VERIFIER_nondet_float() [L169] 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_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L169] 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_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L170] var_1_21 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L172] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L172] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L173] var_1_29 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L175] CALL assume_abort_if_not(var_1_29 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L175] RET assume_abort_if_not(var_1_29 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L176] var_1_32 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L177] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L178] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L178] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L179] var_1_35 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L180] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L181] CALL assume_abort_if_not(var_1_35 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L181] RET assume_abort_if_not(var_1_35 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L182] var_1_37 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L183] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L186] var_1_42 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L187] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L188] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L188] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L204] RET updateVariables() [L205] CALL step() [L60] COND FALSE !(var_1_5 >= var_1_6) [L69] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L71] unsigned char stepLocal_1 = var_1_15; [L72] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L73] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L74] COND TRUE var_1_15 && stepLocal_1 [L75] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L80] COND TRUE var_1_13 < ((((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)))) [L81] COND FALSE !(var_1_13 > var_1_1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L84] EXPR var_1_29 ^ var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L84] EXPR (var_1_29 ^ var_1_20) >> var_1_13 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L84] COND FALSE !(((var_1_29 ^ var_1_20) >> var_1_13) > ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) [L95] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L104] COND TRUE (var_1_38 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_37 [L105] var_1_41 = var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L107] COND TRUE var_1_11 == var_1_18 [L108] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L110] COND FALSE !(var_1_23 >= -25) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L113] COND TRUE (var_1_37 - var_1_38) >= (var_1_18 * var_1_22) [L114] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L116] COND FALSE !((((((var_1_22) < (var_1_37)) ? (var_1_22) : (var_1_37))) >= (var_1_38 / var_1_42)) || var_1_35) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_13 & var_1_24 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_20 ^ (var_1_13 & var_1_24) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L121] COND TRUE var_1_29 <= (var_1_20 ^ (var_1_13 & var_1_24)) [L122] COND FALSE !(\read(var_1_35)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L130] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L133] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L136] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L138] var_1_22 = var_1_12 [L139] var_1_23 = var_1_8 [L140] var_1_24 = var_1_6 [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=-7841, var_1_5=31, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 12, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1564 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1548 mSDsluCounter, 4372 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2612 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1847 IncrementalHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 1760 mSDtfsCounter, 1847 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1539 GetRequests, 1425 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=903occurred in iteration=10, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 465 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2666 NumberOfCodeBlocks, 2666 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2844 ConstructedInterpolants, 0 QuantifiedInterpolants, 17753 SizeOfPredicates, 10 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 23511/24360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:30:47,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:30:50,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:30:50,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:30:50,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:30:50,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:30:50,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:30:50,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:30:50,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:30:50,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:30:50,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:30:50,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:30:50,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:30:50,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:30:50,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:30:50,551 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:30:50,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:30:50,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:30:50,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:30:50,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:30:50,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:30:50,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:30:50,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:30:50,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:30:50,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:30:50,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:30:50,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:30:50,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:30:50,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:30:50,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:30:50,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:30:50,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:30:50,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:30:50,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:30:50,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:30:50,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:50,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:30:50,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:30:50,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:30:50,558 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:30:50,558 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:30:50,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:30:50,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:30:50,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:30:50,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:30:50,560 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:30:50,560 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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2024-10-13 02:30:50,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:30:50,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:30:50,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:30:50,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:30:50,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:30:50,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-10-13 02:30:52,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:30:52,813 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:30:52,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-10-13 02:30:52,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60dc4392/920e095a37724a8e89e3f4548dd9ad75/FLAG7d2756215 [2024-10-13 02:30:52,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60dc4392/920e095a37724a8e89e3f4548dd9ad75 [2024-10-13 02:30:52,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:30:52,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:30:52,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:52,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:30:52,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:30:52,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:52" (1/1) ... [2024-10-13 02:30:52,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f3d611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:52, skipping insertion in model container [2024-10-13 02:30:52,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:30:52" (1/1) ... [2024-10-13 02:30:52,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:30:53,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-10-13 02:30:53,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:53,222 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:30:53,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-10-13 02:30:53,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:30:53,321 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:30:53,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53 WrapperNode [2024-10-13 02:30:53,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:30:53,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:53,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:30:53,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:30:53,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,394 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-13 02:30:53,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:30:53,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:30:53,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:30:53,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:30:53,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:30:53,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:30:53,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:30:53,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:30:53,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:30:53,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (1/1) ... [2024-10-13 02:30:53,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:30:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:30:53,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:30:53,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:30:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:30:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:30:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:30:53,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:30:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:30:53,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:30:53,654 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:30:53,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:31:23,369 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 02:31:23,370 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:31:23,430 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:31:23,430 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:31:23,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:23 BoogieIcfgContainer [2024-10-13 02:31:23,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:31:23,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:31:23,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:31:23,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:31:23,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:30:52" (1/3) ... [2024-10-13 02:31:23,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dcabe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:31:23, skipping insertion in model container [2024-10-13 02:31:23,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:30:53" (2/3) ... [2024-10-13 02:31:23,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dcabe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:31:23, skipping insertion in model container [2024-10-13 02:31:23,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:23" (3/3) ... [2024-10-13 02:31:23,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-10-13 02:31:23,465 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:31:23,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:31:23,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:31:23,539 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;@1ee997bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:31:23,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:31:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:31:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 02:31:23,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:23,557 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:23,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2101477047, now seen corresponding path program 1 times [2024-10-13 02:31:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:31:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762998673] [2024-10-13 02:31:23,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:23,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:23,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:31:23,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:31:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:31:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:25,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:31:25,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-13 02:31:25,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:31:25,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:31:25,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762998673] [2024-10-13 02:31:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762998673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:25,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:31:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748537578] [2024-10-13 02:31:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:31:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:31:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:31:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:31:25,431 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:31:27,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:31:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:27,240 INFO L93 Difference]: Finished difference Result 163 states and 301 transitions. [2024-10-13 02:31:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:31:27,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2024-10-13 02:31:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:27,272 INFO L225 Difference]: With dead ends: 163 [2024-10-13 02:31:27,272 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 02:31:27,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:31:27,279 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:27,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 02:31:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 02:31:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 02:31:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:31:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 132 transitions. [2024-10-13 02:31:27,343 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 132 transitions. Word has length 181 [2024-10-13 02:31:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:27,344 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 132 transitions. [2024-10-13 02:31:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:31:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 132 transitions. [2024-10-13 02:31:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 02:31:27,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:27,348 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:27,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:31:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:27,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1732995839, now seen corresponding path program 1 times [2024-10-13 02:31:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:31:27,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952948315] [2024-10-13 02:31:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:27,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:31:27,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:31:27,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:31:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:29,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:31:29,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 856 proven. 78 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-10-13 02:31:36,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:31:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 02:31:41,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:31:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952948315] [2024-10-13 02:31:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952948315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:31:41,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:31:41,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-10-13 02:31:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844170864] [2024-10-13 02:31:41,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:31:41,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 02:31:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:31:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 02:31:41,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:31:41,118 INFO L87 Difference]: Start difference. First operand 81 states and 132 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44)