./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.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 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:26:41,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:26:41,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:26:41,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:26:41,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:26:41,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:26:41,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:26:41,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:26:41,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:26:41,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:26:41,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:26:41,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:26:41,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:26:41,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:26:41,830 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:26:41,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:26:41,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:26:41,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:26:41,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:26:41,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:26:41,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:26:41,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:26:41,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:26:41,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:26:41,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:26:41,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:26:41,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:26:41,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:26:41,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:26:41,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:26:41,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:26:41,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:26:41,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:26:41,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:26:41,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:26:41,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:26:41,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:26:41,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:26:41,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:26:41,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:26:41,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:26:41,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:26:41,842 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 -> 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 [2024-10-24 08:26:42,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:26:42,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:26:42,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:26:42,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:26:42,088 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:26:42,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-24 08:26:43,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:26:43,576 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:26:43,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-24 08:26:43,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f00569af/a88f51b0f43348b5910a29fc25a286d6/FLAG971d9cbac [2024-10-24 08:26:43,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f00569af/a88f51b0f43348b5910a29fc25a286d6 [2024-10-24 08:26:43,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:26:43,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:26:43,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:26:43,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:26:43,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:26:43,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:43,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462f1edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43, skipping insertion in model container [2024-10-24 08:26:43,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:43,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:26:43,787 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-24 08:26:43,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:26:43,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:26:43,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-24 08:26:43,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:26:43,994 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:26:43,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43 WrapperNode [2024-10-24 08:26:43,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:26:43,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:26:43,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:26:43,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:26:44,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,056 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2024-10-24 08:26:44,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:26:44,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:26:44,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:26:44,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:26:44,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,108 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-24 08:26:44,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:26:44,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:26:44,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:26:44,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:26:44,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (1/1) ... [2024-10-24 08:26:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:26:44,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:26:44,181 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-24 08:26:44,184 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-24 08:26:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:26:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:26:44,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:26:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:26:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:26:44,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:26:44,324 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:26:44,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:26:44,810 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 08:26:44,811 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:26:44,840 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:26:44,840 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:26:44,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:26:44 BoogieIcfgContainer [2024-10-24 08:26:44,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:26:44,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:26:44,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:26:44,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:26:44,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:26:43" (1/3) ... [2024-10-24 08:26:44,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f032074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:26:44, skipping insertion in model container [2024-10-24 08:26:44,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:26:43" (2/3) ... [2024-10-24 08:26:44,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f032074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:26:44, skipping insertion in model container [2024-10-24 08:26:44,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:26:44" (3/3) ... [2024-10-24 08:26:44,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-24 08:26:44,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:26:44,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:26:44,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:26:44,926 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;@47593948, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:26:44,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:26:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:26:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 08:26:44,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:44,944 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:44,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:44,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1736333692, now seen corresponding path program 1 times [2024-10-24 08:26:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498152293] [2024-10-24 08:26:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:45,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:45,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498152293] [2024-10-24 08:26:45,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498152293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:45,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:45,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:26:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818002815] [2024-10-24 08:26:45,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:45,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:26:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:26:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:26:45,495 INFO L87 Difference]: Start difference. First operand has 112 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 08:26:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:45,535 INFO L93 Difference]: Finished difference Result 221 states and 390 transitions. [2024-10-24 08:26:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:26:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-10-24 08:26:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:45,545 INFO L225 Difference]: With dead ends: 221 [2024-10-24 08:26:45,545 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 08:26:45,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-24 08:26:45,552 INFO L432 NwaCegarLoop]: 172 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, 172 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-24 08:26:45,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:26:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 08:26:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 08:26:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:26:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2024-10-24 08:26:45,598 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 175 transitions. Word has length 205 [2024-10-24 08:26:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:45,599 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 175 transitions. [2024-10-24 08:26:45,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 08:26:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 175 transitions. [2024-10-24 08:26:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 08:26:45,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:45,603 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:45,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:26:45,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1243381712, now seen corresponding path program 1 times [2024-10-24 08:26:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903265055] [2024-10-24 08:26:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903265055] [2024-10-24 08:26:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903265055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:46,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:26:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895556856] [2024-10-24 08:26:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:46,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:26:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:26:46,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:26:46,339 INFO L87 Difference]: Start difference. First operand 110 states and 175 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:46,549 INFO L93 Difference]: Finished difference Result 255 states and 403 transitions. [2024-10-24 08:26:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:26:46,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-24 08:26:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:46,556 INFO L225 Difference]: With dead ends: 255 [2024-10-24 08:26:46,559 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 08:26:46,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:26:46,561 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 42 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:46,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 821 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:26:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 08:26:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2024-10-24 08:26:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:26:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 204 transitions. [2024-10-24 08:26:46,587 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 204 transitions. Word has length 205 [2024-10-24 08:26:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 204 transitions. [2024-10-24 08:26:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 204 transitions. [2024-10-24 08:26:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 08:26:46,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:46,593 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:46,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:26:46,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1463237682, now seen corresponding path program 1 times [2024-10-24 08:26:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439677367] [2024-10-24 08:26:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:46,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:46,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439677367] [2024-10-24 08:26:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439677367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:46,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:46,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:26:46,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068839513] [2024-10-24 08:26:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:46,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:26:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:26:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:26:46,845 INFO L87 Difference]: Start difference. First operand 128 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:46,881 INFO L93 Difference]: Finished difference Result 255 states and 407 transitions. [2024-10-24 08:26:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:26:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-24 08:26:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:46,886 INFO L225 Difference]: With dead ends: 255 [2024-10-24 08:26:46,886 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 08:26:46,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:26:46,890 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:46,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:26:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 08:26:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-24 08:26:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 94 states have internal predecessors, (138), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:26:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 202 transitions. [2024-10-24 08:26:46,907 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 202 transitions. Word has length 205 [2024-10-24 08:26:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:46,908 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 202 transitions. [2024-10-24 08:26:46,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 202 transitions. [2024-10-24 08:26:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-24 08:26:46,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:46,915 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:46,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:26:46,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:46,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2068331951, now seen corresponding path program 1 times [2024-10-24 08:26:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:46,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023423263] [2024-10-24 08:26:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023423263] [2024-10-24 08:26:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023423263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:47,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:47,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:26:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46073052] [2024-10-24 08:26:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:47,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:26:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:26:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:26:47,328 INFO L87 Difference]: Start difference. First operand 128 states and 202 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:47,533 INFO L93 Difference]: Finished difference Result 383 states and 605 transitions. [2024-10-24 08:26:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:26:47,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-10-24 08:26:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:47,536 INFO L225 Difference]: With dead ends: 383 [2024-10-24 08:26:47,536 INFO L226 Difference]: Without dead ends: 256 [2024-10-24 08:26:47,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-24 08:26:47,541 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 147 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:47,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 475 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:26:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-24 08:26:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2024-10-24 08:26:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 173 states have internal predecessors, (252), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 08:26:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 380 transitions. [2024-10-24 08:26:47,584 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 380 transitions. Word has length 206 [2024-10-24 08:26:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:47,585 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 380 transitions. [2024-10-24 08:26:47,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 380 transitions. [2024-10-24 08:26:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-24 08:26:47,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:47,588 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:47,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:26:47,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 840347522, now seen corresponding path program 1 times [2024-10-24 08:26:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613425640] [2024-10-24 08:26:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613425640] [2024-10-24 08:26:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613425640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:47,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:26:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915698431] [2024-10-24 08:26:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:47,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:26:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:26:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:26:47,907 INFO L87 Difference]: Start difference. First operand 240 states and 380 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:48,106 INFO L93 Difference]: Finished difference Result 549 states and 860 transitions. [2024-10-24 08:26:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:26:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-24 08:26:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:48,109 INFO L225 Difference]: With dead ends: 549 [2024-10-24 08:26:48,111 INFO L226 Difference]: Without dead ends: 393 [2024-10-24 08:26:48,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-24 08:26:48,114 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 184 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:48,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 500 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:26:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-24 08:26:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 376. [2024-10-24 08:26:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 276 states have (on average 1.4384057971014492) internal successors, (397), 276 states have internal predecessors, (397), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-24 08:26:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 589 transitions. [2024-10-24 08:26:48,159 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 589 transitions. Word has length 207 [2024-10-24 08:26:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:48,160 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 589 transitions. [2024-10-24 08:26:48,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 589 transitions. [2024-10-24 08:26:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-24 08:26:48,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:48,162 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:48,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:26:48,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:48,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash -395850220, now seen corresponding path program 1 times [2024-10-24 08:26:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786669181] [2024-10-24 08:26:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786669181] [2024-10-24 08:26:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786669181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:48,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:26:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151386697] [2024-10-24 08:26:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:48,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:26:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:26:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:26:48,527 INFO L87 Difference]: Start difference. First operand 376 states and 589 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:48,848 INFO L93 Difference]: Finished difference Result 998 states and 1549 transitions. [2024-10-24 08:26:48,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:26:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-24 08:26:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:48,856 INFO L225 Difference]: With dead ends: 998 [2024-10-24 08:26:48,856 INFO L226 Difference]: Without dead ends: 728 [2024-10-24 08:26:48,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:26:48,858 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 393 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:48,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1322 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:26:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-24 08:26:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 666. [2024-10-24 08:26:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 500 states have (on average 1.444) internal successors, (722), 500 states have internal predecessors, (722), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-24 08:26:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1042 transitions. [2024-10-24 08:26:48,917 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1042 transitions. Word has length 208 [2024-10-24 08:26:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:48,918 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1042 transitions. [2024-10-24 08:26:48,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1042 transitions. [2024-10-24 08:26:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-24 08:26:48,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:48,920 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:48,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:26:48,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:48,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 284208150, now seen corresponding path program 1 times [2024-10-24 08:26:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:48,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539034910] [2024-10-24 08:26:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:49,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:49,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539034910] [2024-10-24 08:26:49,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539034910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:49,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:49,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:26:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484517848] [2024-10-24 08:26:49,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:49,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:26:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:26:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:26:49,151 INFO L87 Difference]: Start difference. First operand 666 states and 1042 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:49,222 INFO L93 Difference]: Finished difference Result 1258 states and 1964 transitions. [2024-10-24 08:26:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:26:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-24 08:26:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:49,226 INFO L225 Difference]: With dead ends: 1258 [2024-10-24 08:26:49,226 INFO L226 Difference]: Without dead ends: 666 [2024-10-24 08:26:49,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-24 08:26:49,228 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:49,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 332 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:26:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-24 08:26:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2024-10-24 08:26:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 500 states have (on average 1.442) internal successors, (721), 500 states have internal predecessors, (721), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-24 08:26:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1041 transitions. [2024-10-24 08:26:49,265 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1041 transitions. Word has length 208 [2024-10-24 08:26:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:49,266 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1041 transitions. [2024-10-24 08:26:49,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1041 transitions. [2024-10-24 08:26:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-24 08:26:49,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:49,267 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:49,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:26:49,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash 503062868, now seen corresponding path program 1 times [2024-10-24 08:26:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622740141] [2024-10-24 08:26:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622740141] [2024-10-24 08:26:49,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622740141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:49,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:49,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:26:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435369975] [2024-10-24 08:26:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:49,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:26:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:26:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:26:49,697 INFO L87 Difference]: Start difference. First operand 666 states and 1041 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:49,925 INFO L93 Difference]: Finished difference Result 1306 states and 2027 transitions. [2024-10-24 08:26:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:26:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-24 08:26:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:49,930 INFO L225 Difference]: With dead ends: 1306 [2024-10-24 08:26:49,930 INFO L226 Difference]: Without dead ends: 724 [2024-10-24 08:26:49,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-24 08:26:49,932 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 137 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:49,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 471 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:26:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-24 08:26:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 674. [2024-10-24 08:26:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 508 states have (on average 1.4311023622047243) internal successors, (727), 508 states have internal predecessors, (727), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-24 08:26:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1047 transitions. [2024-10-24 08:26:49,975 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1047 transitions. Word has length 208 [2024-10-24 08:26:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:49,976 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1047 transitions. [2024-10-24 08:26:49,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1047 transitions. [2024-10-24 08:26:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 08:26:49,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:49,978 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:26:49,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:49,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1423692727, now seen corresponding path program 1 times [2024-10-24 08:26:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372276680] [2024-10-24 08:26:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:50,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372276680] [2024-10-24 08:26:50,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372276680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:50,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:26:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583971168] [2024-10-24 08:26:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:50,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:26:50,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:50,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:26:50,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:26:50,256 INFO L87 Difference]: Start difference. First operand 674 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:50,461 INFO L93 Difference]: Finished difference Result 1748 states and 2704 transitions. [2024-10-24 08:26:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:26:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-24 08:26:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:50,467 INFO L225 Difference]: With dead ends: 1748 [2024-10-24 08:26:50,467 INFO L226 Difference]: Without dead ends: 1184 [2024-10-24 08:26:50,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:26:50,470 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 209 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:50,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 596 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:26:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-10-24 08:26:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1100. [2024-10-24 08:26:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 802 states have (on average 1.4102244389027432) internal successors, (1131), 802 states have internal predecessors, (1131), 288 states have call successors, (288), 9 states have call predecessors, (288), 9 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-24 08:26:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1707 transitions. [2024-10-24 08:26:50,543 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1707 transitions. Word has length 209 [2024-10-24 08:26:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:50,545 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1707 transitions. [2024-10-24 08:26:50,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1707 transitions. [2024-10-24 08:26:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 08:26:50,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:50,547 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:50,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 08:26:50,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash -969818518, now seen corresponding path program 1 times [2024-10-24 08:26:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801208484] [2024-10-24 08:26:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 08:26:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801208484] [2024-10-24 08:26:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801208484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:26:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221517718] [2024-10-24 08:26:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:50,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:26:50,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:26:50,767 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-24 08:26:50,768 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-24 08:26:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:50,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:26:50,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:26:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 951 proven. 33 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-10-24 08:26:51,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:26:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 08:26:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221517718] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:26:51,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:26:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-24 08:26:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606590012] [2024-10-24 08:26:51,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:26:51,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:26:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:26:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:26:51,235 INFO L87 Difference]: Start difference. First operand 1100 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-24 08:26:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:51,497 INFO L93 Difference]: Finished difference Result 2194 states and 3364 transitions. [2024-10-24 08:26:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:26:51,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 214 [2024-10-24 08:26:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:51,503 INFO L225 Difference]: With dead ends: 2194 [2024-10-24 08:26:51,504 INFO L226 Difference]: Without dead ends: 1154 [2024-10-24 08:26:51,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:26:51,507 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 207 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:51,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 305 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:26:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-10-24 08:26:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1136. [2024-10-24 08:26:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 829 states have (on average 1.353437876960193) internal successors, (1122), 829 states have internal predecessors, (1122), 288 states have call successors, (288), 18 states have call predecessors, (288), 18 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-24 08:26:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1698 transitions. [2024-10-24 08:26:51,569 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1698 transitions. Word has length 214 [2024-10-24 08:26:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1698 transitions. [2024-10-24 08:26:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-24 08:26:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1698 transitions. [2024-10-24 08:26:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 08:26:51,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:51,571 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:51,586 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-24 08:26:51,772 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-24 08:26:51,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash -844857880, now seen corresponding path program 1 times [2024-10-24 08:26:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454888131] [2024-10-24 08:26:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454888131] [2024-10-24 08:26:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454888131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:26:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772633851] [2024-10-24 08:26:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:51,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:26:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:26:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:26:51,889 INFO L87 Difference]: Start difference. First operand 1136 states and 1698 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:52,022 INFO L93 Difference]: Finished difference Result 3100 states and 4605 transitions. [2024-10-24 08:26:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:26:52,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-10-24 08:26:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:52,033 INFO L225 Difference]: With dead ends: 3100 [2024-10-24 08:26:52,033 INFO L226 Difference]: Without dead ends: 2033 [2024-10-24 08:26:52,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-24 08:26:52,037 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 133 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:52,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 372 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:26:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2024-10-24 08:26:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2023. [2024-10-24 08:26:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 1523 states have (on average 1.3493105712409719) internal successors, (2055), 1531 states have internal predecessors, (2055), 464 states have call successors, (464), 35 states have call predecessors, (464), 35 states have return successors, (464), 456 states have call predecessors, (464), 464 states have call successors, (464) [2024-10-24 08:26:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2983 transitions. [2024-10-24 08:26:52,169 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2983 transitions. Word has length 217 [2024-10-24 08:26:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:52,169 INFO L471 AbstractCegarLoop]: Abstraction has 2023 states and 2983 transitions. [2024-10-24 08:26:52,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2983 transitions. [2024-10-24 08:26:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 08:26:52,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:52,172 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:52,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 08:26:52,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:52,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1239224666, now seen corresponding path program 1 times [2024-10-24 08:26:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309808165] [2024-10-24 08:26:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 08:26:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309808165] [2024-10-24 08:26:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309808165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:26:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114240636] [2024-10-24 08:26:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:26:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:26:52,423 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-24 08:26:52,424 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-24 08:26:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:52,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:26:52,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:26:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 867 proven. 27 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-24 08:26:52,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:26:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 08:26:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114240636] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:26:52,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:26:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-24 08:26:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839334974] [2024-10-24 08:26:52,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:26:52,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:26:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:26:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:26:52,776 INFO L87 Difference]: Start difference. First operand 2023 states and 2983 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-24 08:26:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:53,014 INFO L93 Difference]: Finished difference Result 3197 states and 4652 transitions. [2024-10-24 08:26:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:26:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 217 [2024-10-24 08:26:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:53,021 INFO L225 Difference]: With dead ends: 3197 [2024-10-24 08:26:53,022 INFO L226 Difference]: Without dead ends: 1244 [2024-10-24 08:26:53,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:26:53,027 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 207 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:53,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 293 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:26:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-24 08:26:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2024-10-24 08:26:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 883 states have (on average 1.3012457531143828) internal successors, (1149), 883 states have internal predecessors, (1149), 288 states have call successors, (288), 36 states have call predecessors, (288), 36 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-24 08:26:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1725 transitions. [2024-10-24 08:26:53,093 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1725 transitions. Word has length 217 [2024-10-24 08:26:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:53,094 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1725 transitions. [2024-10-24 08:26:53,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-24 08:26:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1725 transitions. [2024-10-24 08:26:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 08:26:53,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:53,096 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:53,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:26:53,296 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,SelfDestructingSolverStorable11 [2024-10-24 08:26:53,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1420170403, now seen corresponding path program 1 times [2024-10-24 08:26:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385835381] [2024-10-24 08:26:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:53,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385835381] [2024-10-24 08:26:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385835381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:53,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:26:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896257073] [2024-10-24 08:26:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:53,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:26:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:26:53,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:26:53,442 INFO L87 Difference]: Start difference. First operand 1208 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:53,508 INFO L93 Difference]: Finished difference Result 2347 states and 3359 transitions. [2024-10-24 08:26:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:26:53,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-10-24 08:26:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:53,516 INFO L225 Difference]: With dead ends: 2347 [2024-10-24 08:26:53,516 INFO L226 Difference]: Without dead ends: 1217 [2024-10-24 08:26:53,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-24 08:26:53,520 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:53,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:26:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-10-24 08:26:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-10-24 08:26:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 892 states have (on average 1.298206278026906) internal successors, (1158), 892 states have internal predecessors, (1158), 288 states have call successors, (288), 36 states have call predecessors, (288), 36 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-24 08:26:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1734 transitions. [2024-10-24 08:26:53,606 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1734 transitions. Word has length 219 [2024-10-24 08:26:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:53,607 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1734 transitions. [2024-10-24 08:26:53,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1734 transitions. [2024-10-24 08:26:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 08:26:53,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:53,609 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:53,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 08:26:53,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:53,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2121770277, now seen corresponding path program 1 times [2024-10-24 08:26:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:53,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663624980] [2024-10-24 08:26:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:26:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982133357] [2024-10-24 08:26:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:53,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:26:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:26:53,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:26:53,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 08:26:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:53,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 08:26:53,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:26:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 373 proven. 84 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-24 08:26:54,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:26:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663624980] [2024-10-24 08:26:55,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 08:26:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982133357] [2024-10-24 08:26:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982133357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:26:55,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:26:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-24 08:26:55,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42986073] [2024-10-24 08:26:55,619 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 08:26:55,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:26:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:26:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:26:55,620 INFO L87 Difference]: Start difference. First operand 1217 states and 1734 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 08:26:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:56,235 INFO L93 Difference]: Finished difference Result 3127 states and 4394 transitions. [2024-10-24 08:26:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 08:26:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 219 [2024-10-24 08:26:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:56,246 INFO L225 Difference]: With dead ends: 3127 [2024-10-24 08:26:56,246 INFO L226 Difference]: Without dead ends: 2039 [2024-10-24 08:26:56,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-24 08:26:56,250 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 164 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:56,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 636 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:26:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2024-10-24 08:26:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1955. [2024-10-24 08:26:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1452 states have (on average 1.296831955922865) internal successors, (1883), 1460 states have internal predecessors, (1883), 432 states have call successors, (432), 70 states have call predecessors, (432), 70 states have return successors, (432), 424 states have call predecessors, (432), 432 states have call successors, (432) [2024-10-24 08:26:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2747 transitions. [2024-10-24 08:26:56,394 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2747 transitions. Word has length 219 [2024-10-24 08:26:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:56,394 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2747 transitions. [2024-10-24 08:26:56,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 08:26:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2747 transitions. [2024-10-24 08:26:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 08:26:56,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:56,396 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:56,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 08:26:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:26:56,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1443943785, now seen corresponding path program 1 times [2024-10-24 08:26:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11667645] [2024-10-24 08:26:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:26:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:26:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:26:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 08:26:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 08:26:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:26:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 08:26:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:26:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 08:26:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:26:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 08:26:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:26:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 08:26:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:26:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:26:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:26:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 08:26:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:26:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 08:26:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:26:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 08:26:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 08:26:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 08:26:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 08:26:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:26:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11667645] [2024-10-24 08:26:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11667645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:26:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054431907] [2024-10-24 08:26:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:26:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:26:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:26:56,829 INFO L87 Difference]: Start difference. First operand 1955 states and 2747 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:57,001 INFO L93 Difference]: Finished difference Result 3367 states and 4764 transitions. [2024-10-24 08:26:57,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:26:57,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-10-24 08:26:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:57,014 INFO L225 Difference]: With dead ends: 3367 [2024-10-24 08:26:57,015 INFO L226 Difference]: Without dead ends: 2752 [2024-10-24 08:26:57,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:26:57,017 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 96 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:57,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 486 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:26:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2024-10-24 08:26:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 1956. [2024-10-24 08:26:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1453 states have (on average 1.296627666896077) internal successors, (1884), 1461 states have internal predecessors, (1884), 432 states have call successors, (432), 70 states have call predecessors, (432), 70 states have return successors, (432), 424 states have call predecessors, (432), 432 states have call successors, (432) [2024-10-24 08:26:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2748 transitions. [2024-10-24 08:26:57,134 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2748 transitions. Word has length 219 [2024-10-24 08:26:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:57,135 INFO L471 AbstractCegarLoop]: Abstraction has 1956 states and 2748 transitions. [2024-10-24 08:26:57,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:26:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2748 transitions. [2024-10-24 08:26:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 08:26:57,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:57,137 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 08:26:57,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 432826535, now seen corresponding path program 1 times [2024-10-24 08:26:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757805593] [2024-10-24 08:26:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:26:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136272058] [2024-10-24 08:26:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:57,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:26:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:26:57,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:26:57,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 08:26:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:26:57,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:26:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:26:57,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:26:57,536 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:26:57,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:26:57,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 08:26:57,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 08:26:57,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:26:57,853 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:26:57,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:26:57 BoogieIcfgContainer [2024-10-24 08:26:57,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:26:57,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:26:57,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:26:57,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:26:57,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:26:44" (3/4) ... [2024-10-24 08:26:57,858 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:26:57,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:26:57,860 INFO L158 Benchmark]: Toolchain (without parser) took 14253.59ms. Allocated memory was 186.6MB in the beginning and 427.8MB in the end (delta: 241.2MB). Free memory was 129.3MB in the beginning and 162.9MB in the end (delta: -33.5MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. [2024-10-24 08:26:57,860 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:26:57,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.35ms. Allocated memory is still 186.6MB. Free memory was 129.3MB in the beginning and 152.1MB in the end (delta: -22.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:26:57,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 186.6MB. Free memory was 151.3MB in the beginning and 142.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 08:26:57,860 INFO L158 Benchmark]: Boogie Preprocessor took 92.25ms. Allocated memory is still 186.6MB. Free memory was 142.9MB in the beginning and 130.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 08:26:57,861 INFO L158 Benchmark]: RCFGBuilder took 691.06ms. Allocated memory is still 186.6MB. Free memory was 130.3MB in the beginning and 84.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-24 08:26:57,861 INFO L158 Benchmark]: TraceAbstraction took 13012.16ms. Allocated memory was 186.6MB in the beginning and 427.8MB in the end (delta: 241.2MB). Free memory was 84.2MB in the beginning and 162.9MB in the end (delta: -78.7MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. [2024-10-24 08:26:57,861 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 427.8MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:26:57,862 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.27ms. Allocated memory is still 98.6MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.35ms. Allocated memory is still 186.6MB. Free memory was 129.3MB in the beginning and 152.1MB in the end (delta: -22.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 186.6MB. Free memory was 151.3MB in the beginning and 142.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.25ms. Allocated memory is still 186.6MB. Free memory was 142.9MB in the beginning and 130.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 691.06ms. Allocated memory is still 186.6MB. Free memory was 130.3MB in the beginning and 84.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13012.16ms. Allocated memory was 186.6MB in the beginning and 427.8MB in the end (delta: 241.2MB). Free memory was 84.2MB in the beginning and 162.9MB in the end (delta: -78.7MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 427.8MB. Free memory is still 162.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 someBinaryDOUBLEComparisonOperation at line 187, overapproximation of bitwiseOr at line 187, overapproximation of someBinaryArithmeticDOUBLEoperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] unsigned short int var_1_26 = 26914; [L45] unsigned short int var_1_27 = 26182; [L46] unsigned char var_1_28 = 5; [L47] unsigned char var_1_29 = 50; [L48] unsigned char var_1_30 = 10; [L49] signed long int var_1_31 = -32; [L50] unsigned char var_1_32 = 0; [L51] unsigned char var_1_33 = 1; [L52] unsigned char var_1_34 = 0; [L53] signed long int var_1_35 = 1000000; [L54] signed long int var_1_36 = 64; [L55] unsigned char last_1_var_1_3 = 64; [L56] unsigned short int last_1_var_1_6 = 10; [L57] unsigned short int last_1_var_1_15 = 5; [L58] unsigned short int last_1_var_1_20 = 50; [L59] unsigned short int last_1_var_1_21 = 0; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L180] last_1_var_1_3 = var_1_3 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] var_1_5 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] var_1_9 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L135] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L136] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L136] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L137] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L137] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L138] var_1_10 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L139] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L140] var_1_11 = __VERIFIER_nondet_double() [L141] 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=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L141] 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=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L143] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L146] var_1_14 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L147] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L149] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L150] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L150] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L155] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L156] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L156] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L159] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L159] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L160] var_1_26 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L161] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L162] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L162] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L163] var_1_27 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L164] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L165] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L165] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L166] var_1_29 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L167] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L168] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L168] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L169] var_1_30 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L170] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L171] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L171] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L173] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L174] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L174] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L177] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L177] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L195] RET updateVariables() [L196] CALL step() [L63] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L64] COND TRUE ((((var_1_6) < (var_1_23)) ? (var_1_6) : (var_1_23))) >= var_1_15 [L65] var_1_24 = ((var_1_26 + var_1_27) - var_1_23) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L67] COND TRUE var_1_27 > 0 [L68] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L70] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L71] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L75] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L76] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L76] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_21) [L79] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L82] var_1_35 = ((((var_1_26) > (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) ? (var_1_26) : (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L83] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L90] COND FALSE !(var_1_16 >= var_1_6) [L93] var_1_36 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L96] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L97] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L100] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L100] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L101] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=129, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L102] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=129, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L105] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L109] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L110] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L111] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L117] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L118] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L119] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L120] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L120] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L123] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L124] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187-L188] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2042 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1996 mSDsluCounter, 7601 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5058 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1547 IncrementalHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 2543 mSDtfsCounter, 1547 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 2060 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2023occurred in iteration=11, InterpolantAutomatonStates: 85, 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, 15 MinimizatonAttempts, 1191 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 4254 NumberOfCodeBlocks, 4254 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4009 ConstructedInterpolants, 0 QuantifiedInterpolants, 9478 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 37432/37696 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-24 08:26:57,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.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 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:26:59,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:26:59,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:26:59,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:26:59,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:26:59,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:26:59,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:26:59,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:26:59,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:26:59,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:26:59,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:26:59,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:26:59,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:26:59,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:26:59,950 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:26:59,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:26:59,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:26:59,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:26:59,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:26:59,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:26:59,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:26:59,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:26:59,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:26:59,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:26:59,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:26:59,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:26:59,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:26:59,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:26:59,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:26:59,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:26:59,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:26:59,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:26:59,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:26:59,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:26:59,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:26:59,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:26:59,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:26:59,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:26:59,958 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:26:59,958 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:26:59,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:26:59,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:26:59,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:26:59,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:26:59,960 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:26:59,960 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 -> 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 [2024-10-24 08:27:00,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:27:00,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:27:00,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:27:00,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:27:00,249 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:27:00,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-24 08:27:01,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:27:01,750 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:27:01,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-24 08:27:01,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb764cbb/3ea0e82474ec4ea6a65d0d7517824298/FLAGb513f0576 [2024-10-24 08:27:02,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb764cbb/3ea0e82474ec4ea6a65d0d7517824298 [2024-10-24 08:27:02,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:27:02,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:27:02,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:27:02,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:27:02,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:27:02,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112e15f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02, skipping insertion in model container [2024-10-24 08:27:02,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:27:02,340 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-24 08:27:02,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:27:02,433 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:27:02,444 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-24 08:27:02,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:27:02,525 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:27:02,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02 WrapperNode [2024-10-24 08:27:02,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:27:02,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:27:02,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:27:02,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:27:02,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,584 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-24 08:27:02,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:27:02,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:27:02,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:27:02,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:27:02,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,622 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-24 08:27:02,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:27:02,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:27:02,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:27:02,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:27:02,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (1/1) ... [2024-10-24 08:27:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:27:02,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:27:02,688 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-24 08:27:02,691 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-24 08:27:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:27:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:27:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:27:02,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:27:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:27:02,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:27:02,834 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:27:02,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:27:09,053 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:27:09,054 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:27:09,102 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:27:09,104 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:27:09,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:27:09 BoogieIcfgContainer [2024-10-24 08:27:09,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:27:09,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:27:09,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:27:09,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:27:09,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:27:02" (1/3) ... [2024-10-24 08:27:09,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76967a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:27:09, skipping insertion in model container [2024-10-24 08:27:09,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:27:02" (2/3) ... [2024-10-24 08:27:09,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76967a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:27:09, skipping insertion in model container [2024-10-24 08:27:09,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:27:09" (3/3) ... [2024-10-24 08:27:09,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-24 08:27:09,128 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:27:09,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:27:09,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:27:09,193 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;@6c04224d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:27:09,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:27:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:27:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 08:27:09,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:27:09,215 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:27:09,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:27:09,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:27:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -178584841, now seen corresponding path program 1 times [2024-10-24 08:27:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:27:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063690841] [2024-10-24 08:27:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:27:09,237 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-24 08:27:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:27:09,240 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-24 08:27:09,241 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-24 08:27:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:27:09,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:27:09,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:27:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2024-10-24 08:27:09,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:27:09,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:27:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063690841] [2024-10-24 08:27:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063690841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:27:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:27:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:27:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642344345] [2024-10-24 08:27:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:27:09,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:27:09,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:27:09,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:27:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:27:09,797 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 08:27:13,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:27:13,940 INFO L93 Difference]: Finished difference Result 165 states and 298 transitions. [2024-10-24 08:27:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:27:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-24 08:27:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:27:13,986 INFO L225 Difference]: With dead ends: 165 [2024-10-24 08:27:13,986 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 08:27:13,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-24 08:27:13,991 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:27:13,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 08:27:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 08:27:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 08:27:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:27:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-24 08:27:14,036 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 199 [2024-10-24 08:27:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:27:14,037 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-24 08:27:14,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 08:27:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-24 08:27:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 08:27:14,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:27:14,041 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:27:14,057 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-24 08:27:14,242 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-24 08:27:14,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:27:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:27:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1161151811, now seen corresponding path program 1 times [2024-10-24 08:27:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:27:14,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643628134] [2024-10-24 08:27:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:27:14,245 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-24 08:27:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:27:14,248 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-24 08:27:14,277 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-24 08:27:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:27:14,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 08:27:14,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:27:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 964 proven. 60 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-10-24 08:27:16,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:27:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 08:27:17,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:27:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643628134] [2024-10-24 08:27:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643628134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:27:17,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:27:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-10-24 08:27:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068962002] [2024-10-24 08:27:17,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:27:17,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:27:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:27:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:27:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:27:17,490 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-24 08:27:23,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:25,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:27:25,981 INFO L93 Difference]: Finished difference Result 173 states and 265 transitions. [2024-10-24 08:27:26,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:27:26,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 199 [2024-10-24 08:27:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:27:26,022 INFO L225 Difference]: With dead ends: 173 [2024-10-24 08:27:26,022 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 08:27:26,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:27:26,025 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:27:26,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 184 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2024-10-24 08:27:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 08:27:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-24 08:27:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:27:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 08:27:26,047 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 199 [2024-10-24 08:27:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:27:26,048 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 08:27:26,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-24 08:27:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 08:27:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-24 08:27:26,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:27:26,051 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:27:26,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:27:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:27:26,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:27:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:27:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 537160743, now seen corresponding path program 1 times [2024-10-24 08:27:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:27:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023324548] [2024-10-24 08:27:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:27:26,253 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-24 08:27:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:27:26,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:27:26,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:27:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:27:26,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 08:27:26,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:27:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:27:30,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:27:30,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:27:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023324548] [2024-10-24 08:27:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023324548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:27:30,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:27:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:27:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475379721] [2024-10-24 08:27:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:27:30,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:27:30,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:27:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:27:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:27:30,575 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:27:34,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:38,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:27:38,691 INFO L93 Difference]: Finished difference Result 261 states and 385 transitions. [2024-10-24 08:27:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:27:38,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-10-24 08:27:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:27:38,695 INFO L225 Difference]: With dead ends: 261 [2024-10-24 08:27:38,695 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 08:27:38,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:27:38,696 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 18 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:27:38,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2024-10-24 08:27:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 08:27:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2024-10-24 08:27:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 08:27:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-10-24 08:27:38,725 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 201 [2024-10-24 08:27:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:27:38,726 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-10-24 08:27:38,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:27:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-10-24 08:27:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-24 08:27:38,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:27:38,729 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:27:38,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 08:27:38,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:27:38,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:27:38,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:27:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -49645271, now seen corresponding path program 1 times [2024-10-24 08:27:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:27:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521711235] [2024-10-24 08:27:38,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:27:38,931 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-24 08:27:38,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:27:38,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:27:38,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 08:27:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:27:39,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:27:39,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:27:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:27:42,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:27:42,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:27:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521711235] [2024-10-24 08:27:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521711235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:27:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:27:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:27:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879625236] [2024-10-24 08:27:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:27:42,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:27:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:27:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:27:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:27:42,514 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:27:47,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:52,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:55,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:27:59,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:28:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:28:00,042 INFO L93 Difference]: Finished difference Result 352 states and 515 transitions. [2024-10-24 08:28:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:28:00,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-10-24 08:28:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:28:00,048 INFO L225 Difference]: With dead ends: 352 [2024-10-24 08:28:00,048 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 08:28:00,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:28:00,050 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 86 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:28:00,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 416 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 17.4s Time] [2024-10-24 08:28:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 08:28:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2024-10-24 08:28:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 143 states have internal predecessors, (174), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-24 08:28:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2024-10-24 08:28:00,087 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 201 [2024-10-24 08:28:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:28:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2024-10-24 08:28:00,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:28:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2024-10-24 08:28:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-24 08:28:00,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:28:00,090 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:28:00,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 08:28:00,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:28:00,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:28:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:28:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 651419307, now seen corresponding path program 1 times [2024-10-24 08:28:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:28:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873622494] [2024-10-24 08:28:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:28:00,292 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-24 08:28:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:28:00,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:28:00,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 08:28:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:28:00,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 08:28:00,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:28:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:28:00,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:28:00,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:28:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873622494] [2024-10-24 08:28:00,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873622494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:28:00,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:28:00,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:28:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195625711] [2024-10-24 08:28:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:28:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:28:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:28:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:28:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:28:00,736 INFO L87 Difference]: Start difference. First operand 249 states and 366 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:28:04,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:28:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:28:04,931 INFO L93 Difference]: Finished difference Result 338 states and 497 transitions. [2024-10-24 08:28:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:28:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-10-24 08:28:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:28:04,965 INFO L225 Difference]: With dead ends: 338 [2024-10-24 08:28:04,965 INFO L226 Difference]: Without dead ends: 249 [2024-10-24 08:28:04,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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-24 08:28:04,968 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:28:04,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 08:28:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-24 08:28:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-10-24 08:28:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 143 states have internal predecessors, (172), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-24 08:28:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 364 transitions. [2024-10-24 08:28:04,998 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 364 transitions. Word has length 201 [2024-10-24 08:28:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:28:05,000 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 364 transitions. [2024-10-24 08:28:05,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 08:28:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 364 transitions. [2024-10-24 08:28:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-24 08:28:05,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:28:05,003 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:28:05,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 08:28:05,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:28:05,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:28:05,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:28:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 835545559, now seen corresponding path program 1 times [2024-10-24 08:28:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:28:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72946707] [2024-10-24 08:28:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:28:05,205 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-24 08:28:05,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:28:05,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:28:05,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 08:28:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:28:05,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:28:05,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:28:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 08:28:09,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:28:09,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:28:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72946707] [2024-10-24 08:28:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72946707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:28:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:28:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:28:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509177245] [2024-10-24 08:28:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:28:09,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:28:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:28:09,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:28:09,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:28:09,235 INFO L87 Difference]: Start difference. First operand 249 states and 364 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)