./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-pe-ci_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.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 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:09:20,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:09:21,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:09:21,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:09:21,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:09:21,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:09:21,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:09:21,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:09:21,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:09:21,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:09:21,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:09:21,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:09:21,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:09:21,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:09:21,118 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:09:21,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:09:21,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:09:21,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:09:21,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:09:21,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:09:21,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:09:21,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:09:21,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:09:21,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:09:21,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:09:21,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:09:21,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:09:21,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:09:21,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:09:21,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:09:21,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:09:21,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:09:21,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:09:21,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:09:21,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:09:21,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:09:21,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:09:21,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:09:21,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:09:21,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:09:21,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:09:21,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:09:21,144 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 -> 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 [2024-10-14 09:09:21,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:09:21,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:09:21,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:09:21,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:09:21,431 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:09:21,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-10-14 09:09:22,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:09:23,160 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:09:23,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-10-14 09:09:23,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a8d6fe0/e8b1723c5d9c43daa55a1c0f4c00ae64/FLAG593188390 [2024-10-14 09:09:23,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a8d6fe0/e8b1723c5d9c43daa55a1c0f4c00ae64 [2024-10-14 09:09:23,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:09:23,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:09:23,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:09:23,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:09:23,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:09:23,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9044845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23, skipping insertion in model container [2024-10-14 09:09:23,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:09:23,405 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-pe-ci_file-84.i[919,932] [2024-10-14 09:09:23,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:09:23,521 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:09:23,544 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-pe-ci_file-84.i[919,932] [2024-10-14 09:09:23,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:09:23,642 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:09:23,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23 WrapperNode [2024-10-14 09:09:23,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:09:23,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:09:23,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:09:23,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:09:23,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,727 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-10-14 09:09:23,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:09:23,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:09:23,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:09:23,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:09:23,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,788 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:09:23,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:09:23,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:09:23,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:09:23,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:09:23,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (1/1) ... [2024-10-14 09:09:23,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:09:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:09:23,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:09:23,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:09:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:09:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:09:23,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:09:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:09:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:09:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:09:24,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:09:24,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:09:24,561 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-14 09:09:24,561 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:09:24,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:09:24,604 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:09:24,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:24 BoogieIcfgContainer [2024-10-14 09:09:24,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:09:24,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:09:24,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:09:24,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:09:24,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:09:23" (1/3) ... [2024-10-14 09:09:24,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4f67a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:09:24, skipping insertion in model container [2024-10-14 09:09:24,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:23" (2/3) ... [2024-10-14 09:09:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4f67a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:09:24, skipping insertion in model container [2024-10-14 09:09:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:24" (3/3) ... [2024-10-14 09:09:24,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-10-14 09:09:24,632 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:09:24,633 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:09:24,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:09:24,719 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;@5acba399, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:09:24,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:09:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 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-14 09:09:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 09:09:24,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:24,764 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-14 09:09:24,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -351344522, now seen corresponding path program 1 times [2024-10-14 09:09:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:24,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555115234] [2024-10-14 09:09:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:24,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,396 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-14 09:09:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555115234] [2024-10-14 09:09:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555115234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:25,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:25,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:09:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053000115] [2024-10-14 09:09:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:25,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:09:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:25,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:09:25,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:09:25,445 INFO L87 Difference]: Start difference. First operand has 105 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 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.5) internal successors, (49), 2 states have internal predecessors, (49), 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-14 09:09:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:25,515 INFO L93 Difference]: Finished difference Result 207 states and 368 transitions. [2024-10-14 09:09:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:09:25,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 206 [2024-10-14 09:09:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:25,526 INFO L225 Difference]: With dead ends: 207 [2024-10-14 09:09:25,527 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 09:09:25,533 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-14 09:09:25,536 INFO L432 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:25,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:09:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 09:09:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 09:09:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 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-14 09:09:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 164 transitions. [2024-10-14 09:09:25,592 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 164 transitions. Word has length 206 [2024-10-14 09:09:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:25,593 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 164 transitions. [2024-10-14 09:09:25,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-14 09:09:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 164 transitions. [2024-10-14 09:09:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 09:09:25,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:25,599 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-14 09:09:25,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:09:25,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1336647602, now seen corresponding path program 1 times [2024-10-14 09:09:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197970894] [2024-10-14 09:09:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,081 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-14 09:09:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197970894] [2024-10-14 09:09:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197970894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:26,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:09:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157444776] [2024-10-14 09:09:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:26,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:09:26,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:26,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:09:26,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:09:26,091 INFO L87 Difference]: Start difference. First operand 103 states and 164 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-14 09:09:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:26,188 INFO L93 Difference]: Finished difference Result 301 states and 478 transitions. [2024-10-14 09:09:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:09:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-14 09:09:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:26,195 INFO L225 Difference]: With dead ends: 301 [2024-10-14 09:09:26,196 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 09:09:26,198 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-14 09:09:26,199 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 146 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:26,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 417 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:09:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 09:09:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2024-10-14 09:09:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 81 states have internal predecessors, (117), 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-14 09:09:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 181 transitions. [2024-10-14 09:09:26,228 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 181 transitions. Word has length 206 [2024-10-14 09:09:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:26,232 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 181 transitions. [2024-10-14 09:09:26,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-14 09:09:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 181 transitions. [2024-10-14 09:09:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 09:09:26,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:26,239 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-14 09:09:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:09:26,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash 518999152, now seen corresponding path program 1 times [2024-10-14 09:09:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95446162] [2024-10-14 09:09:26,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:26,559 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-14 09:09:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95446162] [2024-10-14 09:09:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95446162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:26,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:09:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656463027] [2024-10-14 09:09:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:26,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:09:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:09:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:09:26,567 INFO L87 Difference]: Start difference. First operand 115 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-14 09:09:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:26,621 INFO L93 Difference]: Finished difference Result 214 states and 338 transitions. [2024-10-14 09:09:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:09:26,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-14 09:09:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:26,626 INFO L225 Difference]: With dead ends: 214 [2024-10-14 09:09:26,628 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 09:09:26,629 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-14 09:09:26,630 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:26,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:09:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 09:09:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-14 09:09:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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-14 09:09:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2024-10-14 09:09:26,653 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 206 [2024-10-14 09:09:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:26,654 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2024-10-14 09:09:26,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-14 09:09:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2024-10-14 09:09:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 09:09:26,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:26,660 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-14 09:09:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:09:26,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1487839468, now seen corresponding path program 1 times [2024-10-14 09:09:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123207023] [2024-10-14 09:09:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:30,155 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-14 09:09:30,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:30,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123207023] [2024-10-14 09:09:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123207023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:30,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 09:09:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138835928] [2024-10-14 09:09:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:30,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 09:09:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 09:09:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:09:30,160 INFO L87 Difference]: Start difference. First operand 100 states and 154 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 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-14 09:09:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:32,037 INFO L93 Difference]: Finished difference Result 415 states and 606 transitions. [2024-10-14 09:09:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 09:09:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 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-14 09:09:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:32,040 INFO L225 Difference]: With dead ends: 415 [2024-10-14 09:09:32,040 INFO L226 Difference]: Without dead ends: 316 [2024-10-14 09:09:32,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-14 09:09:32,042 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 529 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:32,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 09:09:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-14 09:09:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 172. [2024-10-14 09:09:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 136 states have internal predecessors, (193), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 09:09:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2024-10-14 09:09:32,083 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 207 [2024-10-14 09:09:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:32,084 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2024-10-14 09:09:32,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 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-14 09:09:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2024-10-14 09:09:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 09:09:32,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:32,087 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-14 09:09:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:09:32,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1816174036, now seen corresponding path program 1 times [2024-10-14 09:09:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218456574] [2024-10-14 09:09:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:35,571 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-14 09:09:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218456574] [2024-10-14 09:09:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218456574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:09:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531936807] [2024-10-14 09:09:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:09:35,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:35,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:09:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:09:35,576 INFO L87 Difference]: Start difference. First operand 172 states and 261 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-14 09:09:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:36,589 INFO L93 Difference]: Finished difference Result 422 states and 631 transitions. [2024-10-14 09:09:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:09:36,591 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-14 09:09:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:36,594 INFO L225 Difference]: With dead ends: 422 [2024-10-14 09:09:36,594 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 09:09:36,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:09:36,598 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 70 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:36,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 738 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:09:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 09:09:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 172. [2024-10-14 09:09:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 136 states have internal predecessors, (193), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 09:09:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2024-10-14 09:09:36,629 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 208 [2024-10-14 09:09:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:36,629 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2024-10-14 09:09:36,630 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-14 09:09:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2024-10-14 09:09:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 09:09:36,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:36,632 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-14 09:09:36,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:09:36,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:36,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash 673354926, now seen corresponding path program 1 times [2024-10-14 09:09:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:36,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691195023] [2024-10-14 09:09:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:38,984 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-14 09:09:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691195023] [2024-10-14 09:09:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691195023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:09:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495034903] [2024-10-14 09:09:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:38,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:09:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:38,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:09:38,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:09:38,986 INFO L87 Difference]: Start difference. First operand 172 states and 261 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-14 09:09:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:40,183 INFO L93 Difference]: Finished difference Result 422 states and 631 transitions. [2024-10-14 09:09:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:09:40,184 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-14 09:09:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:40,187 INFO L225 Difference]: With dead ends: 422 [2024-10-14 09:09:40,187 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 09:09:40,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:09:40,189 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 39 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:40,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 826 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 09:09:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 09:09:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2024-10-14 09:09:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 135 states have internal predecessors, (191), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 09:09:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2024-10-14 09:09:40,207 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 208 [2024-10-14 09:09:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2024-10-14 09:09:40,208 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-14 09:09:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2024-10-14 09:09:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 09:09:40,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:40,210 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-14 09:09:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:09:40,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:40,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -43878262, now seen corresponding path program 1 times [2024-10-14 09:09:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762375519] [2024-10-14 09:09:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:41,999 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-14 09:09:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762375519] [2024-10-14 09:09:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762375519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:42,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:09:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574855282] [2024-10-14 09:09:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:42,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:09:42,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:09:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:09:42,002 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-14 09:09:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:42,811 INFO L93 Difference]: Finished difference Result 389 states and 580 transitions. [2024-10-14 09:09:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:09:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-14 09:09:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:42,817 INFO L225 Difference]: With dead ends: 389 [2024-10-14 09:09:42,817 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 09:09:42,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:09:42,820 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:42,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 472 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:09:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 09:09:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2024-10-14 09:09:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 151 states have internal predecessors, (206), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 09:09:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 282 transitions. [2024-10-14 09:09:42,847 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 282 transitions. Word has length 208 [2024-10-14 09:09:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:42,848 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 282 transitions. [2024-10-14 09:09:42,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (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-14 09:09:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 282 transitions. [2024-10-14 09:09:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 09:09:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:42,851 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-14 09:09:42,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:09:42,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1059043663, now seen corresponding path program 1 times [2024-10-14 09:09:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:42,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031836851] [2024-10-14 09:09:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:45,829 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-14 09:09:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031836851] [2024-10-14 09:09:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031836851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 09:09:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625495869] [2024-10-14 09:09:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:45,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 09:09:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 09:09:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:09:45,833 INFO L87 Difference]: Start difference. First operand 192 states and 282 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 09:09:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:47,802 INFO L93 Difference]: Finished difference Result 579 states and 841 transitions. [2024-10-14 09:09:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 09:09:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-10-14 09:09:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:47,807 INFO L225 Difference]: With dead ends: 579 [2024-10-14 09:09:47,807 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 09:09:47,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:09:47,810 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 431 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:47,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 488 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 09:09:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 09:09:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 244. [2024-10-14 09:09:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 203 states have internal predecessors, (281), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 09:09:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 357 transitions. [2024-10-14 09:09:47,844 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 357 transitions. Word has length 209 [2024-10-14 09:09:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:47,846 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 357 transitions. [2024-10-14 09:09:47,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 09:09:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 357 transitions. [2024-10-14 09:09:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 09:09:47,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:47,851 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-14 09:09:47,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 09:09:47,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:47,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1876692113, now seen corresponding path program 1 times [2024-10-14 09:09:47,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176260677] [2024-10-14 09:09:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:47,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:51,079 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-14 09:09:51,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176260677] [2024-10-14 09:09:51,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176260677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:51,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 09:09:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799413255] [2024-10-14 09:09:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:51,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 09:09:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 09:09:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 09:09:51,082 INFO L87 Difference]: Start difference. First operand 244 states and 357 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 09:09:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:53,261 INFO L93 Difference]: Finished difference Result 609 states and 885 transitions. [2024-10-14 09:09:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 09:09:53,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-10-14 09:09:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:53,267 INFO L225 Difference]: With dead ends: 609 [2024-10-14 09:09:53,267 INFO L226 Difference]: Without dead ends: 366 [2024-10-14 09:09:53,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-14 09:09:53,269 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 224 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:53,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 566 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 09:09:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-14 09:09:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 244. [2024-10-14 09:09:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 203 states have internal predecessors, (281), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 09:09:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 357 transitions. [2024-10-14 09:09:53,301 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 357 transitions. Word has length 209 [2024-10-14 09:09:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:53,303 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 357 transitions. [2024-10-14 09:09:53,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 09:09:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 357 transitions. [2024-10-14 09:09:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 09:09:53,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:53,306 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-14 09:09:53,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 09:09:53,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:53,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -840188945, now seen corresponding path program 1 times [2024-10-14 09:09:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:53,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685716909] [2024-10-14 09:09:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:09:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:09:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:09:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:09:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:09:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:09:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:09:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:09:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:09:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:09:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:09:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:09:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:09:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:09:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:09:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:09:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:09:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:09:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:09:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:09:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:09:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:09:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:09:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:09:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:09:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:09:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:09:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:09:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:09:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:09:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:09:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:09:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:56,081 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-14 09:09:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:09:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685716909] [2024-10-14 09:09:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685716909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 09:09:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063609851] [2024-10-14 09:09:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:56,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 09:09:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:09:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 09:09:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:09:56,083 INFO L87 Difference]: Start difference. First operand 244 states and 357 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-14 09:09:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:57,695 INFO L93 Difference]: Finished difference Result 637 states and 922 transitions. [2024-10-14 09:09:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 09:09:57,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-14 09:09:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:57,699 INFO L225 Difference]: With dead ends: 637 [2024-10-14 09:09:57,699 INFO L226 Difference]: Without dead ends: 394 [2024-10-14 09:09:57,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:09:57,701 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 127 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:57,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 785 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 09:09:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-14 09:09:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 248. [2024-10-14 09:09:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.4) internal successors, (287), 207 states have internal predecessors, (287), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 09:09:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 363 transitions. [2024-10-14 09:09:57,731 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 363 transitions. Word has length 209 [2024-10-14 09:09:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:57,733 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 363 transitions. [2024-10-14 09:09:57,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-14 09:09:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 363 transitions. [2024-10-14 09:09:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 09:09:57,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:57,736 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-14 09:09:57,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 09:09:57,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1657837395, now seen corresponding path program 1 times [2024-10-14 09:09:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:09:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421674391] [2024-10-14 09:09:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:09:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:10:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:10:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:10:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:10:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:10:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:10:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:10:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:10:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:10:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:10:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:10:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:10:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:10:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:10:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:10:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:10:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:10:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:10:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:10:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:10:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:10:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:10:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:10:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:10:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:10:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:10:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:10:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:10:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:10:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:10:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:10:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:10:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:00,169 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-14 09:10:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:10:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421674391] [2024-10-14 09:10:00,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421674391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:10:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:10:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 09:10:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201201598] [2024-10-14 09:10:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:00,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 09:10:00,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:10:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 09:10:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:10:00,172 INFO L87 Difference]: Start difference. First operand 248 states and 363 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 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-14 09:10:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:01,502 INFO L93 Difference]: Finished difference Result 585 states and 849 transitions. [2024-10-14 09:10:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 09:10:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 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-14 09:10:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:01,506 INFO L225 Difference]: With dead ends: 585 [2024-10-14 09:10:01,506 INFO L226 Difference]: Without dead ends: 338 [2024-10-14 09:10:01,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-14 09:10:01,510 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 171 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:01,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 936 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 09:10:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-14 09:10:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 244. [2024-10-14 09:10:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 203 states have internal predecessors, (281), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 09:10:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 357 transitions. [2024-10-14 09:10:01,541 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 357 transitions. Word has length 209 [2024-10-14 09:10:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:01,542 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 357 transitions. [2024-10-14 09:10:01,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 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-14 09:10:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 357 transitions. [2024-10-14 09:10:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 09:10:01,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:01,544 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] [2024-10-14 09:10:01,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 09:10:01,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:01,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash 443544059, now seen corresponding path program 1 times [2024-10-14 09:10:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:10:01,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903515361] [2024-10-14 09:10:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:10:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:10:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:10:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:10:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:10:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:10:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:10:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:10:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:10:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:10:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:10:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:10:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:10:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:10:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:10:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:10:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:10:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:10:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:10:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:10:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:10:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:10:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:10:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:10:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:10:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:10:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:10:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:10:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:10:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:10:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:10:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:10:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:10:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:01,678 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-14 09:10:01,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:10:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903515361] [2024-10-14 09:10:01,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903515361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:10:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:10:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:10:01,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387261920] [2024-10-14 09:10:01,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:01,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:10:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:10:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:10:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:10:01,681 INFO L87 Difference]: Start difference. First operand 244 states and 357 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-14 09:10:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:01,798 INFO L93 Difference]: Finished difference Result 533 states and 773 transitions. [2024-10-14 09:10:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:10:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 210 [2024-10-14 09:10:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:01,801 INFO L225 Difference]: With dead ends: 533 [2024-10-14 09:10:01,801 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 09:10:01,802 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-14 09:10:01,805 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:01,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 238 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:10:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 09:10:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 262. [2024-10-14 09:10:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 219 states have (on average 1.3881278538812785) internal successors, (304), 221 states have internal predecessors, (304), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 09:10:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 380 transitions. [2024-10-14 09:10:01,832 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 380 transitions. Word has length 210 [2024-10-14 09:10:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:01,833 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 380 transitions. [2024-10-14 09:10:01,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-14 09:10:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 380 transitions. [2024-10-14 09:10:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 09:10:01,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:01,835 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] [2024-10-14 09:10:01,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 09:10:01,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:01,836 INFO L85 PathProgramCache]: Analyzing trace with hash 134000335, now seen corresponding path program 1 times [2024-10-14 09:10:01,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:10:01,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982771305] [2024-10-14 09:10:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:10:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:10:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:10:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:10:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:10:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:10:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:10:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:10:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:10:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:10:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:10:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:10:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:10:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:10:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:10:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:10:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:10:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:10:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:10:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:10:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:10:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:10:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:10:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:10:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:10:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:10:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:10:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:10:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:10:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:10:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:10:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:10:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:10:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,108 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-14 09:10:02,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:10:02,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982771305] [2024-10-14 09:10:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982771305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:10:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:10:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:10:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650336785] [2024-10-14 09:10:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:02,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:10:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:10:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:10:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:10:02,111 INFO L87 Difference]: Start difference. First operand 262 states and 380 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-14 09:10:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:02,303 INFO L93 Difference]: Finished difference Result 727 states and 1054 transitions. [2024-10-14 09:10:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:10:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 210 [2024-10-14 09:10:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:02,307 INFO L225 Difference]: With dead ends: 727 [2024-10-14 09:10:02,307 INFO L226 Difference]: Without dead ends: 466 [2024-10-14 09:10:02,308 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-14 09:10:02,308 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:02,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 516 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:10:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-14 09:10:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 325. [2024-10-14 09:10:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 247 states have (on average 1.3481781376518218) internal successors, (333), 249 states have internal predecessors, (333), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:10:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 473 transitions. [2024-10-14 09:10:02,352 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 473 transitions. Word has length 210 [2024-10-14 09:10:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 473 transitions. [2024-10-14 09:10:02,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-14 09:10:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 473 transitions. [2024-10-14 09:10:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 09:10:02,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:02,354 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] [2024-10-14 09:10:02,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 09:10:02,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:02,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1990258975, now seen corresponding path program 1 times [2024-10-14 09:10:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:10:02,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376729530] [2024-10-14 09:10:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:10:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:10:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:10:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:10:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:10:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:10:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:10:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:10:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:10:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:10:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:10:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:10:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 09:10:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 09:10:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 09:10:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 09:10:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 09:10:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:10:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 09:10:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:10:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 09:10:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:10:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:10:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:10:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 09:10:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 09:10:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 09:10:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 09:10:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 09:10:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 09:10:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 09:10:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 09:10:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:10:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:02,469 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-14 09:10:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:10:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376729530] [2024-10-14 09:10:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376729530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:10:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:10:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:10:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595193742] [2024-10-14 09:10:02,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:10:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:10:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:10:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:10:02,472 INFO L87 Difference]: Start difference. First operand 325 states and 473 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-14 09:10:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:02,615 INFO L93 Difference]: Finished difference Result 611 states and 880 transitions. [2024-10-14 09:10:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:10:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 210 [2024-10-14 09:10:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:02,619 INFO L225 Difference]: With dead ends: 611 [2024-10-14 09:10:02,619 INFO L226 Difference]: Without dead ends: 350 [2024-10-14 09:10:02,620 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-14 09:10:02,620 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 49 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:02,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 277 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:10:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-14 09:10:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 312. [2024-10-14 09:10:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 236 states have (on average 1.3389830508474576) internal successors, (316), 237 states have internal predecessors, (316), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 09:10:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 452 transitions. [2024-10-14 09:10:02,662 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 452 transitions. Word has length 210 [2024-10-14 09:10:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:02,662 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 452 transitions. [2024-10-14 09:10:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-14 09:10:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 452 transitions. [2024-10-14 09:10:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 09:10:02,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:02,664 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] [2024-10-14 09:10:02,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 09:10:02,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -363987338, now seen corresponding path program 1 times [2024-10-14 09:10:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:10:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858221003] [2024-10-14 09:10:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:10:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:10:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465807311] [2024-10-14 09:10:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:02,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:10:02,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:10:02,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:10:02,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 09:10:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:03,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 09:10:03,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:10:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-14 09:10:03,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:10:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 138 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-14 09:10:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:10:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858221003] [2024-10-14 09:10:04,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:10:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465807311] [2024-10-14 09:10:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465807311] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:10:04,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:10:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-14 09:10:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634400303] [2024-10-14 09:10:04,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:10:04,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 09:10:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:10:04,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 09:10:04,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:10:04,590 INFO L87 Difference]: Start difference. First operand 312 states and 452 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 09:10:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:05,092 INFO L93 Difference]: Finished difference Result 588 states and 833 transitions. [2024-10-14 09:10:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 09:10:05,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 211 [2024-10-14 09:10:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:05,096 INFO L225 Difference]: With dead ends: 588 [2024-10-14 09:10:05,096 INFO L226 Difference]: Without dead ends: 340 [2024-10-14 09:10:05,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:10:05,100 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 216 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:05,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 248 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:10:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-14 09:10:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 332. [2024-10-14 09:10:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 251 states have (on average 1.294820717131474) internal successors, (325), 252 states have internal predecessors, (325), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 09:10:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 461 transitions. [2024-10-14 09:10:05,147 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 461 transitions. Word has length 211 [2024-10-14 09:10:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 461 transitions. [2024-10-14 09:10:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 09:10:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 461 transitions. [2024-10-14 09:10:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 09:10:05,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:05,150 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] [2024-10-14 09:10:05,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 09:10:05,353 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,SelfDestructingSolverStorable14 [2024-10-14 09:10:05,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:05,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:05,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1952335240, now seen corresponding path program 1 times [2024-10-14 09:10:05,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:10:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53423457] [2024-10-14 09:10:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:10:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:10:05,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658776445] [2024-10-14 09:10:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:05,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:10:05,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:10:05,508 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-14 09:10:05,511 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-14 09:10:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:10:05,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:10:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:10:05,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:10:05,984 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:10:05,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:10:06,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 09:10:06,187 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,SelfDestructingSolverStorable15 [2024-10-14 09:10:06,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:10:06,348 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:10:06,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:10:06 BoogieIcfgContainer [2024-10-14 09:10:06,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:10:06,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:10:06,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:10:06,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:10:06,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:24" (3/4) ... [2024-10-14 09:10:06,355 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:10:06,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:10:06,357 INFO L158 Benchmark]: Toolchain (without parser) took 43159.54ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 123.7MB in the beginning and 325.2MB in the end (delta: -201.5MB). Peak memory consumption was 316.5MB. Max. memory is 16.1GB. [2024-10-14 09:10:06,357 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:10:06,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.72ms. Allocated memory is still 180.4MB. Free memory was 123.7MB in the beginning and 106.3MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 09:10:06,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.06ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 101.0MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:10:06,358 INFO L158 Benchmark]: Boogie Preprocessor took 105.89ms. Allocated memory is still 180.4MB. Free memory was 101.0MB in the beginning and 93.9MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 09:10:06,359 INFO L158 Benchmark]: RCFGBuilder took 768.26ms. Allocated memory is still 180.4MB. Free memory was 93.9MB in the beginning and 58.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 09:10:06,359 INFO L158 Benchmark]: TraceAbstraction took 41744.94ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 57.4MB in the beginning and 325.2MB in the end (delta: -267.7MB). Peak memory consumption was 249.4MB. Max. memory is 16.1GB. [2024-10-14 09:10:06,359 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 696.3MB. Free memory is still 325.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:10:06,363 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.19ms. Allocated memory is still 180.4MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.72ms. Allocated memory is still 180.4MB. Free memory was 123.7MB in the beginning and 106.3MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.06ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 101.0MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.89ms. Allocated memory is still 180.4MB. Free memory was 101.0MB in the beginning and 93.9MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 768.26ms. Allocated memory is still 180.4MB. Free memory was 93.9MB in the beginning and 58.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 41744.94ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 57.4MB in the beginning and 325.2MB in the end (delta: -267.7MB). Peak memory consumption was 249.4MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 696.3MB. Free memory is still 325.2MB. 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 189, overapproximation of someUnaryDOUBLEoperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] unsigned short int last_1_var_1_15 = 128; [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] last_1_var_1_15 = var_1_15 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L146] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L150] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L151] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L152] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L154] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L155] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L157] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L159] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L161] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L162] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L164] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L165] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L165] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L167] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=50] [L59] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L64] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L66] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L66] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L67] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L68] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L72] signed long int stepLocal_1 = -4; [L73] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L74] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L79] var_1_18 = var_1_17 [L80] var_1_19 = 0 [L81] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L82] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L85] COND TRUE var_1_3 <= var_1_1 [L86] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L90] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L91] COND TRUE (~ var_1_3) < stepLocal_2 [L92] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L94] var_1_22 = var_1_10 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L95] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L100] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L111] COND TRUE var_1_10 != ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L112] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L114] COND FALSE !((~ var_1_4) > (var_1_4 / var_1_11)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L117] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_4)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L118] COND FALSE !(var_1_7 == var_1_11) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L123] COND TRUE var_1_40 >= var_1_39 [L124] var_1_38 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L127] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L128] COND FALSE !(((var_1_11 + -128) % var_1_10) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L189] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L189-L190] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=-2147483647, var_1_8=-2147483648, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.5s, OverallIterations: 16, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2371 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2368 mSDsluCounter, 7450 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5281 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5049 IncrementalHoareTripleChecker+Invalid, 5252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 2169 mSDtfsCounter, 5049 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1488 GetRequests, 1374 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=15, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 1135 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 3759 NumberOfCodeBlocks, 3759 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3321 ConstructedInterpolants, 0 QuantifiedInterpolants, 37506 SizeOfPredicates, 3 NumberOfNonLiveVariables, 479 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 31471/31744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:10:06,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-pe-ci_file-84.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 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:10:08,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:10:08,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:10:08,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:10:08,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:10:08,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:10:08,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:10:08,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:10:08,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:10:08,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:10:08,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:10:08,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:10:08,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:10:08,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:10:08,813 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:10:08,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:10:08,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:10:08,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:10:08,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:10:08,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:10:08,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:10:08,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:10:08,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:10:08,818 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:10:08,818 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:10:08,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:10:08,819 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:10:08,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:10:08,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:10:08,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:10:08,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:10:08,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:10:08,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:10:08,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:10:08,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:10:08,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:10:08,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:10:08,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:10:08,826 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:10:08,826 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:10:08,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:10:08,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:10:08,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:10:08,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:10:08,827 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:10:08,827 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 -> 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 [2024-10-14 09:10:09,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:10:09,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:10:09,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:10:09,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:10:09,187 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:10:09,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-10-14 09:10:10,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:10:11,058 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:10:11,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-10-14 09:10:11,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff09f9def/3de904a260ca4347862edfcd48cba1b6/FLAG24e9ff43e [2024-10-14 09:10:11,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff09f9def/3de904a260ca4347862edfcd48cba1b6 [2024-10-14 09:10:11,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:10:11,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:10:11,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:10:11,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:10:11,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:10:11,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fc2168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11, skipping insertion in model container [2024-10-14 09:10:11,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:10:11,318 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-pe-ci_file-84.i[919,932] [2024-10-14 09:10:11,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:10:11,443 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:10:11,457 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-pe-ci_file-84.i[919,932] [2024-10-14 09:10:11,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:10:11,524 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:10:11,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11 WrapperNode [2024-10-14 09:10:11,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:10:11,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:10:11,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:10:11,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:10:11,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,590 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-14 09:10:11,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:10:11,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:10:11,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:10:11,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:10:11,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,633 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:10:11,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:10:11,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:10:11,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:10:11,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:10:11,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (1/1) ... [2024-10-14 09:10:11,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:10:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:10:11,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:10:11,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:10:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:10:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:10:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:10:11,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:10:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:10:11,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:10:11,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:10:11,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:10:13,457 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 09:10:13,458 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:10:13,505 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:10:13,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:10:13,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:10:13 BoogieIcfgContainer [2024-10-14 09:10:13,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:10:13,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:10:13,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:10:13,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:10:13,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:10:11" (1/3) ... [2024-10-14 09:10:13,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782bfa48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:10:13, skipping insertion in model container [2024-10-14 09:10:13,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:11" (2/3) ... [2024-10-14 09:10:13,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782bfa48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:10:13, skipping insertion in model container [2024-10-14 09:10:13,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:10:13" (3/3) ... [2024-10-14 09:10:13,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-10-14 09:10:13,531 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:10:13,531 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:10:13,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:10:13,610 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;@586bfc4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:10:13,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:10:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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-14 09:10:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 09:10:13,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:13,637 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] [2024-10-14 09:10:13,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -650618084, now seen corresponding path program 1 times [2024-10-14 09:10:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:10:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918929615] [2024-10-14 09:10:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:13,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:13,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:10:13,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:10:13,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 09:10:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:14,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:10:14,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:10:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 1586 trivial. 0 not checked. [2024-10-14 09:10:14,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:10:14,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:10:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918929615] [2024-10-14 09:10:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918929615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:10:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:10:14,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:10:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808533788] [2024-10-14 09:10:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:14,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:10:14,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:10:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:10:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:10:14,145 INFO L87 Difference]: Start difference. First operand has 87 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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.5) internal successors, (47), 2 states have internal predecessors, (47), 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-14 09:10:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:14,235 INFO L93 Difference]: Finished difference Result 171 states and 312 transitions. [2024-10-14 09:10:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:10:14,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 200 [2024-10-14 09:10:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:14,271 INFO L225 Difference]: With dead ends: 171 [2024-10-14 09:10:14,271 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 09:10:14,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:10:14,278 INFO L432 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:14,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:10:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 09:10:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 09:10:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 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-14 09:10:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 136 transitions. [2024-10-14 09:10:14,349 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 136 transitions. Word has length 200 [2024-10-14 09:10:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 136 transitions. [2024-10-14 09:10:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-14 09:10:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2024-10-14 09:10:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 09:10:14,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:14,358 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] [2024-10-14 09:10:14,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:10:14,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:14,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:14,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1116614488, now seen corresponding path program 1 times [2024-10-14 09:10:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:10:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152478641] [2024-10-14 09:10:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:14,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:14,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:10:14,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:10:14,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:10:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:14,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 09:10:14,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:10:14,968 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-14 09:10:14,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:10:14,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:10:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152478641] [2024-10-14 09:10:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152478641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:10:14,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:10:14,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:10:14,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878640593] [2024-10-14 09:10:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:10:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:10:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:10:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:10:14,981 INFO L87 Difference]: Start difference. First operand 85 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-14 09:10:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:15,088 INFO L93 Difference]: Finished difference Result 166 states and 265 transitions. [2024-10-14 09:10:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:10:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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 200 [2024-10-14 09:10:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:15,104 INFO L225 Difference]: With dead ends: 166 [2024-10-14 09:10:15,104 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 09:10:15,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:10:15,106 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:15,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:10:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 09:10:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 09:10:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 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-14 09:10:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-10-14 09:10:15,121 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 200 [2024-10-14 09:10:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-10-14 09:10:15,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-14 09:10:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-10-14 09:10:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 09:10:15,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:15,127 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-14 09:10:15,144 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-14 09:10:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:15,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:15,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1343463858, now seen corresponding path program 1 times [2024-10-14 09:10:15,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:10:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698028432] [2024-10-14 09:10:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:15,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:15,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:10:15,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:10:15,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 09:10:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:15,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:10:15,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:10:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-14 09:10:16,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:10:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 09:10:18,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:10:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698028432] [2024-10-14 09:10:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698028432] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:10:18,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:10:18,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-14 09:10:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246481243] [2024-10-14 09:10:18,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:10:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 09:10:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:10:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 09:10:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:10:18,098 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 09:10:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:18,947 INFO L93 Difference]: Finished difference Result 175 states and 261 transitions. [2024-10-14 09:10:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 09:10:18,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 201 [2024-10-14 09:10:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:18,962 INFO L225 Difference]: With dead ends: 175 [2024-10-14 09:10:18,962 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 09:10:18,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:10:18,964 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:18,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 187 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 09:10:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 09:10:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-14 09:10:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 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-14 09:10:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-10-14 09:10:18,982 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 201 [2024-10-14 09:10:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:18,983 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-10-14 09:10:18,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 09:10:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-10-14 09:10:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 09:10:18,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:18,987 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-14 09:10:19,003 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 (4)] Forceful destruction successful, exit code 0 [2024-10-14 09:10:19,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:19,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -663405488, now seen corresponding path program 1 times [2024-10-14 09:10:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:10:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192417101] [2024-10-14 09:10:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:19,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:10:19,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:10:19,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 09:10:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:19,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 09:10:19,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:10:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-10-14 09:10:20,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:10:21,528 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-14 09:10:21,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:10:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192417101] [2024-10-14 09:10:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192417101] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 09:10:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:10:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-10-14 09:10:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849094534] [2024-10-14 09:10:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:10:21,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:10:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:10:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:10:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:10:21,532 INFO L87 Difference]: Start difference. First operand 90 states and 131 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-14 09:10:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:10:22,144 INFO L93 Difference]: Finished difference Result 233 states and 333 transitions. [2024-10-14 09:10:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:10:22,149 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-14 09:10:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:10:22,151 INFO L225 Difference]: With dead ends: 233 [2024-10-14 09:10:22,151 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 09:10:22,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:10:22,156 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:10:22,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 214 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:10:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 09:10:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-10-14 09:10:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 91 states have internal predecessors, (112), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 09:10:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 200 transitions. [2024-10-14 09:10:22,184 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 200 transitions. Word has length 201 [2024-10-14 09:10:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:10:22,186 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 200 transitions. [2024-10-14 09:10:22,186 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-14 09:10:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 200 transitions. [2024-10-14 09:10:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 09:10:22,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:10:22,189 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-14 09:10:22,207 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 09:10:22,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:22,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:10:22,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:10:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -663345906, now seen corresponding path program 1 times [2024-10-14 09:10:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:10:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043649312] [2024-10-14 09:10:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:10:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:10:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:10:22,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:10:22,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 09:10:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:10:22,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 09:10:22,827 INFO L278 TraceCheckSpWp]: Computing forward predicates...