./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.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 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:57:06,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:57:06,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:57:06,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:57:06,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:57:07,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:57:07,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:57:07,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:57:07,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:57:07,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:57:07,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:57:07,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:57:07,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:57:07,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:57:07,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:57:07,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:57:07,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:57:07,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:57:07,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:57:07,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:57:07,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:57:07,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:57:07,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:57:07,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:57:07,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:57:07,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:57:07,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:57:07,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:57:07,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:57:07,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:57:07,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:57:07,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:57:07,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:57:07,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:57:07,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:57:07,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:57:07,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:57:07,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:57:07,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:57:07,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:57:07,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:57:07,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:57:07,035 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 -> 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 [2024-11-10 04:57:07,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:57:07,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:57:07,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:57:07,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:57:07,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:57:07,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-10 04:57:08,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:57:09,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:57:09,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-10 04:57:09,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b7a5bb9/50760c022b0149b1ae6ab4e3a0a8b0fc/FLAG2c2ffec52 [2024-11-10 04:57:09,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b7a5bb9/50760c022b0149b1ae6ab4e3a0a8b0fc [2024-11-10 04:57:09,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:57:09,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:57:09,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:57:09,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:57:09,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:57:09,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32375571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09, skipping insertion in model container [2024-11-10 04:57:09,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:57:09,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-10 04:57:09,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:57:09,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:57:09,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-10 04:57:09,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:57:09,821 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:57:09,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09 WrapperNode [2024-11-10 04:57:09,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:57:09,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:57:09,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:57:09,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:57:09,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,891 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 04:57:09,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:57:09,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:57:09,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:57:09,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:57:09,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:57:09,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:57:09,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:57:09,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:57:09,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:57:09,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (1/1) ... [2024-11-10 04:57:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:57:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:10,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:57:10,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:57:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:57:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:57:10,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:57:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:57:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:57:10,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:57:10,141 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:57:10,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:57:10,515 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 04:57:10,516 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:57:10,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:57:10,531 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:57:10,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:57:10 BoogieIcfgContainer [2024-11-10 04:57:10,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:57:10,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:57:10,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:57:10,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:57:10,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:57:09" (1/3) ... [2024-11-10 04:57:10,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d18502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:57:10, skipping insertion in model container [2024-11-10 04:57:10,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:09" (2/3) ... [2024-11-10 04:57:10,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d18502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:57:10, skipping insertion in model container [2024-11-10 04:57:10,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:57:10" (3/3) ... [2024-11-10 04:57:10,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-10 04:57:10,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:57:10,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:57:10,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:57:10,631 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;@30bfc5a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:57:10,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:57:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 04:57:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 04:57:10,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:10,653 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:10,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1339352468, now seen corresponding path program 1 times [2024-11-10 04:57:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574134230] [2024-11-10 04:57:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 04:57:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574134230] [2024-11-10 04:57:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574134230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:57:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204711681] [2024-11-10 04:57:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:11,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:57:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:57:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:57:11,232 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 04:57:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:11,275 INFO L93 Difference]: Finished difference Result 170 states and 302 transitions. [2024-11-10 04:57:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:57:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2024-11-10 04:57:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:11,287 INFO L225 Difference]: With dead ends: 170 [2024-11-10 04:57:11,288 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 04:57:11,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:57:11,296 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:11,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:57:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 04:57:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 04:57:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 04:57:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2024-11-10 04:57:11,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 186 [2024-11-10 04:57:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:11,356 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2024-11-10 04:57:11,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 04:57:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2024-11-10 04:57:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 04:57:11,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:11,364 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:11,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:57:11,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:11,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1221538903, now seen corresponding path program 1 times [2024-11-10 04:57:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:11,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534284640] [2024-11-10 04:57:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 04:57:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534284640] [2024-11-10 04:57:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534284640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:57:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789857583] [2024-11-10 04:57:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:11,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:57:11,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:11,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:57:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:11,759 INFO L87 Difference]: Start difference. First operand 84 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:11,823 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2024-11-10 04:57:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:57:11,824 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2024-11-10 04:57:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:11,827 INFO L225 Difference]: With dead ends: 212 [2024-11-10 04:57:11,827 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 04:57:11,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:11,829 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 71 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:11,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 321 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:57:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 04:57:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2024-11-10 04:57:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 199 transitions. [2024-11-10 04:57:11,877 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 199 transitions. Word has length 186 [2024-11-10 04:57:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:11,878 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 199 transitions. [2024-11-10 04:57:11,878 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 199 transitions. [2024-11-10 04:57:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 04:57:11,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:11,884 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:11,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:57:11,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:11,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -594750381, now seen corresponding path program 1 times [2024-11-10 04:57:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:11,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517940094] [2024-11-10 04:57:11,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:11,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 04:57:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517940094] [2024-11-10 04:57:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517940094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:57:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628248630] [2024-11-10 04:57:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:57:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:12,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:57:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:12,187 INFO L87 Difference]: Start difference. First operand 127 states and 199 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:12,257 INFO L93 Difference]: Finished difference Result 296 states and 466 transitions. [2024-11-10 04:57:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:57:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-10 04:57:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:12,261 INFO L225 Difference]: With dead ends: 296 [2024-11-10 04:57:12,262 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 04:57:12,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:12,264 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:12,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 249 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:57:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 04:57:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2024-11-10 04:57:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 210 transitions. [2024-11-10 04:57:12,283 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 210 transitions. Word has length 187 [2024-11-10 04:57:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:12,285 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 210 transitions. [2024-11-10 04:57:12,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 210 transitions. [2024-11-10 04:57:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 04:57:12,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:12,290 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:57:12,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1105284558, now seen corresponding path program 1 times [2024-11-10 04:57:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759142697] [2024-11-10 04:57:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 04:57:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759142697] [2024-11-10 04:57:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759142697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:57:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632152930] [2024-11-10 04:57:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:12,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:57:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:57:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:12,471 INFO L87 Difference]: Start difference. First operand 135 states and 210 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:12,534 INFO L93 Difference]: Finished difference Result 376 states and 586 transitions. [2024-11-10 04:57:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:57:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-10 04:57:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:12,538 INFO L225 Difference]: With dead ends: 376 [2024-11-10 04:57:12,538 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 04:57:12,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:12,540 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 105 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:12,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 320 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:57:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 04:57:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 141. [2024-11-10 04:57:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions. [2024-11-10 04:57:12,575 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 187 [2024-11-10 04:57:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:12,575 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 220 transitions. [2024-11-10 04:57:12,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2024-11-10 04:57:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 04:57:12,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:12,596 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:12,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:57:12,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:12,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1392731379, now seen corresponding path program 1 times [2024-11-10 04:57:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503358977] [2024-11-10 04:57:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 04:57:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503358977] [2024-11-10 04:57:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503358977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:57:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643097955] [2024-11-10 04:57:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:12,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:57:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:12,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:57:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:12,737 INFO L87 Difference]: Start difference. First operand 141 states and 220 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:12,775 INFO L93 Difference]: Finished difference Result 320 states and 498 transitions. [2024-11-10 04:57:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:57:12,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-10 04:57:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:12,778 INFO L225 Difference]: With dead ends: 320 [2024-11-10 04:57:12,778 INFO L226 Difference]: Without dead ends: 182 [2024-11-10 04:57:12,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:57:12,779 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 29 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:12,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 252 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:57:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-10 04:57:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2024-11-10 04:57:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 110 states have internal predecessors, (155), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 237 transitions. [2024-11-10 04:57:12,808 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 237 transitions. Word has length 187 [2024-11-10 04:57:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:12,809 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 237 transitions. [2024-11-10 04:57:12,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:57:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 237 transitions. [2024-11-10 04:57:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 04:57:12,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:12,811 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:57:12,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:12,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1196217874, now seen corresponding path program 1 times [2024-11-10 04:57:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676645409] [2024-11-10 04:57:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 04:57:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676645409] [2024-11-10 04:57:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676645409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:57:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305024547] [2024-11-10 04:57:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:13,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:13,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:13,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:13,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:57:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:13,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:57:13,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-10 04:57:13,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 04:57:13,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305024547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:57:13,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:57:13,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 04:57:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745329664] [2024-11-10 04:57:13,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:57:13,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:57:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:13,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:57:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:57:13,796 INFO L87 Difference]: Start difference. First operand 153 states and 237 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:57:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:14,044 INFO L93 Difference]: Finished difference Result 311 states and 476 transitions. [2024-11-10 04:57:14,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:57:14,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 187 [2024-11-10 04:57:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:14,047 INFO L225 Difference]: With dead ends: 311 [2024-11-10 04:57:14,047 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 04:57:14,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:57:14,052 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 129 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:14,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 226 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:57:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 04:57:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2024-11-10 04:57:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 111 states have internal predecessors, (152), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 234 transitions. [2024-11-10 04:57:14,074 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 234 transitions. Word has length 187 [2024-11-10 04:57:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 234 transitions. [2024-11-10 04:57:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:57:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 234 transitions. [2024-11-10 04:57:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 04:57:14,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:14,077 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:14,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:57:14,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:57:14,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:14,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1213387978, now seen corresponding path program 1 times [2024-11-10 04:57:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:14,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108798706] [2024-11-10 04:57:14,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:14,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 04:57:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108798706] [2024-11-10 04:57:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108798706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:57:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280235681] [2024-11-10 04:57:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:14,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:14,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:14,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:57:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:14,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 04:57:15,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 568 proven. 66 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2024-11-10 04:57:15,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 04:57:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280235681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:57:15,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:57:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 04:57:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17519401] [2024-11-10 04:57:15,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:57:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 04:57:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 04:57:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:57:15,476 INFO L87 Difference]: Start difference. First operand 155 states and 234 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-10 04:57:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:16,208 INFO L93 Difference]: Finished difference Result 410 states and 588 transitions. [2024-11-10 04:57:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 04:57:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 187 [2024-11-10 04:57:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:16,211 INFO L225 Difference]: With dead ends: 410 [2024-11-10 04:57:16,211 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 04:57:16,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=500, Unknown=0, NotChecked=0, Total=756 [2024-11-10 04:57:16,216 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 459 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:16,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 270 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:57:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 04:57:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 171. [2024-11-10 04:57:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 122 states have (on average 1.278688524590164) internal successors, (156), 123 states have internal predecessors, (156), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 238 transitions. [2024-11-10 04:57:16,239 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 238 transitions. Word has length 187 [2024-11-10 04:57:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:16,240 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 238 transitions. [2024-11-10 04:57:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-10 04:57:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 238 transitions. [2024-11-10 04:57:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:57:16,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:16,242 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:16,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 04:57:16,442 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,SelfDestructingSolverStorable6 [2024-11-10 04:57:16,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1624372471, now seen corresponding path program 1 times [2024-11-10 04:57:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766031365] [2024-11-10 04:57:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:57:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:57:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:57:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:57:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:57:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:57:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:57:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:57:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:57:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:57:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:57:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:57:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:57:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:57:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:57:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:57:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:57:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:57:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:57:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:57:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:57:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:57:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:57:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:57:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:57:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:57:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:57:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:57:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:57:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 04:57:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766031365] [2024-11-10 04:57:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766031365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:57:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787455870] [2024-11-10 04:57:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:16,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:16,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:16,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 04:57:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:16,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:57:16,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 708 proven. 24 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2024-11-10 04:57:17,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 04:57:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787455870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:57:17,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:57:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-10 04:57:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823591457] [2024-11-10 04:57:17,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:57:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 04:57:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 04:57:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:57:17,290 INFO L87 Difference]: Start difference. First operand 171 states and 238 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2024-11-10 04:57:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:17,496 INFO L93 Difference]: Finished difference Result 353 states and 486 transitions. [2024-11-10 04:57:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:57:17,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 189 [2024-11-10 04:57:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:17,498 INFO L225 Difference]: With dead ends: 353 [2024-11-10 04:57:17,499 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 04:57:17,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:57:17,500 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 119 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:17,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 216 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:57:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 04:57:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2024-11-10 04:57:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 125 states have (on average 1.224) internal successors, (153), 126 states have internal predecessors, (153), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 04:57:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 235 transitions. [2024-11-10 04:57:17,522 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 235 transitions. Word has length 189 [2024-11-10 04:57:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:17,523 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 235 transitions. [2024-11-10 04:57:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2024-11-10 04:57:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 235 transitions. [2024-11-10 04:57:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:57:17,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:17,526 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:17,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:57:17,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:17,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1330969464, now seen corresponding path program 1 times [2024-11-10 04:57:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398158609] [2024-11-10 04:57:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:57:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378560700] [2024-11-10 04:57:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:17,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:17,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:17,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 04:57:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:17,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 04:57:17,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-10 04:57:18,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398158609] [2024-11-10 04:57:19,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:57:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378560700] [2024-11-10 04:57:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378560700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:57:19,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:57:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-10 04:57:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189490071] [2024-11-10 04:57:19,050 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 04:57:19,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:57:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:57:19,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:57:19,051 INFO L87 Difference]: Start difference. First operand 175 states and 235 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 04:57:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:19,551 INFO L93 Difference]: Finished difference Result 503 states and 673 transitions. [2024-11-10 04:57:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 04:57:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2024-11-10 04:57:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:19,554 INFO L225 Difference]: With dead ends: 503 [2024-11-10 04:57:19,554 INFO L226 Difference]: Without dead ends: 331 [2024-11-10 04:57:19,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2024-11-10 04:57:19,556 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 89 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:19,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 552 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:57:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-10 04:57:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 251. [2024-11-10 04:57:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 166 states have (on average 1.180722891566265) internal successors, (196), 167 states have internal predecessors, (196), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:57:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 336 transitions. [2024-11-10 04:57:19,607 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 336 transitions. Word has length 189 [2024-11-10 04:57:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:19,607 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 336 transitions. [2024-11-10 04:57:19,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 04:57:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 336 transitions. [2024-11-10 04:57:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:57:19,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:19,610 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:19,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 04:57:19,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:19,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:19,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 922145239, now seen corresponding path program 1 times [2024-11-10 04:57:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959890416] [2024-11-10 04:57:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:57:19,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626390313] [2024-11-10 04:57:19,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:19,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:19,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:19,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 04:57:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:57:20,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:57:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:57:20,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:57:20,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:57:20,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:57:20,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 04:57:20,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 04:57:20,447 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:20,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:57:20,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:57:20 BoogieIcfgContainer [2024-11-10 04:57:20,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:57:20,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:57:20,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:57:20,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:57:20,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:57:10" (3/4) ... [2024-11-10 04:57:20,598 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:57:20,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:57:20,599 INFO L158 Benchmark]: Toolchain (without parser) took 11215.50ms. Allocated memory was 155.2MB in the beginning and 281.0MB in the end (delta: 125.8MB). Free memory was 100.6MB in the beginning and 133.0MB in the end (delta: -32.4MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-10 04:57:20,600 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:57:20,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.22ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 82.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 04:57:20,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.66ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 79.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:57:20,601 INFO L158 Benchmark]: Boogie Preprocessor took 66.28ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 75.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:57:20,601 INFO L158 Benchmark]: IcfgBuilder took 572.06ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 75.0MB in the beginning and 152.6MB in the end (delta: -77.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-10 04:57:20,601 INFO L158 Benchmark]: TraceAbstraction took 10059.93ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 152.6MB in the beginning and 133.0MB in the end (delta: 19.6MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2024-11-10 04:57:20,602 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 281.0MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:57:20,603 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.22ms. Allocated memory is still 155.2MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.22ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 82.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.66ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 79.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.28ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 75.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 572.06ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 75.0MB in the beginning and 152.6MB in the end (delta: -77.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10059.93ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 152.6MB in the beginning and 133.0MB in the end (delta: 19.6MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 281.0MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryDOUBLEComparisonOperation at line 192, overapproximation of someBinaryArithmeticDOUBLEoperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_4 = 7.8; [L25] signed short int var_1_6 = 16; [L26] signed short int var_1_7 = 256; [L27] float var_1_8 = 256.6; [L28] unsigned char var_1_9 = 50; [L29] unsigned char var_1_10 = 5; [L30] double var_1_11 = 127.75; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] double var_1_15 = 15.2; [L35] double var_1_16 = 256.5; [L36] double var_1_17 = 256.5; [L37] double var_1_18 = 0.0; [L38] double var_1_19 = 9.7; [L39] unsigned long int var_1_20 = 10000000; [L40] unsigned long int var_1_21 = 4008920074; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] signed long int var_1_31 = -32; [L45] float var_1_35 = 31.6; [L46] signed short int var_1_38 = -2; [L47] float var_1_40 = 7.2; [L48] signed short int var_1_43 = 25; [L49] signed long int var_1_44 = -2; [L50] signed short int last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_9 = 50; [L52] double last_1_var_1_11 = 127.75; [L53] double last_1_var_1_16 = 256.5; [L54] unsigned long int last_1_var_1_20 = 10000000; VAL [isInitial=0, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_9 = var_1_9 [L187] last_1_var_1_11 = var_1_11 [L188] last_1_var_1_16 = var_1_16 [L189] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L141] var_1_4 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L142] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L143] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L143] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L144] var_1_6 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L145] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L146] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L146] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L147] var_1_7 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L149] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L149] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L150] var_1_10 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L152] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L153] var_1_12 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L154] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L155] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L156] var_1_13 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L158] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L159] var_1_14 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L160] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L161] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L161] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L162] var_1_15 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L165] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L167] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L168] var_1_19 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L169] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L170] var_1_21 = __VERIFIER_nondet_ulong() [L171] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L171] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L172] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L172] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L173] var_1_29 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L174] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L175] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L175] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L176] var_1_30 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L178] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L178] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L179] var_1_44 = __VERIFIER_nondet_long() [L180] CALL assume_abort_if_not(var_1_44 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L180] RET assume_abort_if_not(var_1_44 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L181] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L181] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L182] CALL assume_abort_if_not(var_1_44 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L182] RET assume_abort_if_not(var_1_44 != 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L200] RET updateVariables() [L201] CALL step() [L58] signed long int stepLocal_0 = (((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1)); VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L59] COND FALSE !(last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) [L66] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L68] unsigned long int stepLocal_1 = last_1_var_1_20; VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, stepLocal_1=10000000, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L69] COND FALSE !(((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > stepLocal_1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L72] COND TRUE (last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L73] COND FALSE !(\read(var_1_2)) [L76] var_1_11 = var_1_15 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L81] COND TRUE \read(var_1_13) [L82] var_1_20 = (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L90] COND FALSE !((- var_1_16) <= var_1_4) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L95] COND FALSE !(\read(var_1_2)) [L102] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L104] COND TRUE var_1_1 <= (var_1_7 + var_1_10) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L105] COND FALSE !(var_1_21 < var_1_10) [L108] var_1_23 = var_1_30 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L111] COND FALSE !(var_1_9 != var_1_1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L114] COND FALSE !(var_1_2 && var_1_29) [L117] var_1_35 = (var_1_19 + var_1_19) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L119] var_1_38 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L120] COND FALSE !(\read(var_1_30)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L127] COND TRUE (var_1_7 * var_1_9) > (~ var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L128] COND TRUE var_1_19 == 0.25f [L129] var_1_40 = var_1_19 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L133] COND TRUE ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) <= (2 / ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))) [L134] var_1_43 = ((((var_1_9) > (var_1_9)) ? (var_1_9) : (var_1_9))) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((var_1_2 ? (((var_1_11 / var_1_4) <= var_1_8) ? (var_1_1 == ((signed short int) (var_1_9 - var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) && (((- var_1_16) <= var_1_4) ? (((var_1_11 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) ? ((((((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > last_1_var_1_20) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9))) : ((var_1_9 >= var_1_9) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_9)))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=2147483647, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1081 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1037 mSDsluCounter, 2537 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1373 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1100 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 1164 mSDtfsCounter, 1100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1891 GetRequests, 1822 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 356 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2815 NumberOfCodeBlocks, 2815 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2796 ConstructedInterpolants, 0 QuantifiedInterpolants, 5940 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1731 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 24006/24360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:57:20,635 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.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 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:57:22,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:57:22,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:57:22,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:57:22,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:57:22,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:57:22,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:57:22,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:57:22,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:57:22,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:57:22,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:57:22,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:57:22,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:57:22,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:57:22,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:57:22,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:57:22,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:57:22,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:57:22,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:57:22,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:57:22,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:57:22,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:57:22,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:57:22,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:57:22,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:57:22,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:57:22,970 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:57:22,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:57:22,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:57:22,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:57:22,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:57:22,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:57:22,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:57:22,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:57:22,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:57:22,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:57:22,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:57:22,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:57:22,974 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:57:22,974 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:57:22,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:57:22,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:57:22,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:57:22,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:57:22,975 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 -> 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 [2024-11-10 04:57:23,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:57:23,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:57:23,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:57:23,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:57:23,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:57:23,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-10 04:57:24,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:57:25,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:57:25,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-10 04:57:25,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eefc75c1a/475f2443cb6e46eeae8976e7f52dcaf8/FLAG3f2f08a03 [2024-11-10 04:57:25,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eefc75c1a/475f2443cb6e46eeae8976e7f52dcaf8 [2024-11-10 04:57:25,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:57:25,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:57:25,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:57:25,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:57:25,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:57:25,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eae8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25, skipping insertion in model container [2024-11-10 04:57:25,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:57:25,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-10 04:57:25,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:57:25,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:57:25,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-10 04:57:25,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:57:25,794 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:57:25,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25 WrapperNode [2024-11-10 04:57:25,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:57:25,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:57:25,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:57:25,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:57:25,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,859 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-10 04:57:25,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:57:25,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:57:25,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:57:25,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:57:25,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,910 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:57:25,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:57:25,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:57:25,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:57:25,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:57:25,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (1/1) ... [2024-11-10 04:57:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:57:25,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:25,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:57:25,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:57:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:57:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:57:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:57:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:57:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:57:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:57:26,112 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:57:26,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:57:43,961 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 04:57:43,961 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:57:43,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:57:43,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:57:43,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:57:43 BoogieIcfgContainer [2024-11-10 04:57:43,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:57:43,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:57:43,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:57:43,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:57:43,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:57:25" (1/3) ... [2024-11-10 04:57:43,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d2fc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:57:43, skipping insertion in model container [2024-11-10 04:57:43,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:57:25" (2/3) ... [2024-11-10 04:57:43,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d2fc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:57:43, skipping insertion in model container [2024-11-10 04:57:43,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:57:43" (3/3) ... [2024-11-10 04:57:43,986 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-10 04:57:44,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:57:44,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:57:44,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:57:44,069 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;@20d96693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:57:44,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:57:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 04:57:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 04:57:44,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:44,087 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:44,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1339352468, now seen corresponding path program 1 times [2024-11-10 04:57:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:57:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100243816] [2024-11-10 04:57:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:44,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:57:44,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:57:44,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:57:44,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:57:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:45,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:57:45,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-10 04:57:45,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:57:45,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:57:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100243816] [2024-11-10 04:57:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100243816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:45,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:45,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:57:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060647957] [2024-11-10 04:57:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:45,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:57:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:57:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:57:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:57:45,502 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 04:57:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:45,533 INFO L93 Difference]: Finished difference Result 170 states and 302 transitions. [2024-11-10 04:57:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:57:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2024-11-10 04:57:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:45,543 INFO L225 Difference]: With dead ends: 170 [2024-11-10 04:57:45,543 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 04:57:45,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:57:45,551 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:45,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:57:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 04:57:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 04:57:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 04:57:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2024-11-10 04:57:45,600 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 186 [2024-11-10 04:57:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:45,605 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2024-11-10 04:57:45,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 04:57:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2024-11-10 04:57:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 04:57:45,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:45,612 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:57:45,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 04:57:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:57:45,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1221538903, now seen corresponding path program 1 times [2024-11-10 04:57:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:57:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915912673] [2024-11-10 04:57:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:45,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:57:45,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:57:45,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:57:45,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:57:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:47,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:57:47,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 04:57:59,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:57:59,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:57:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915912673] [2024-11-10 04:57:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915912673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:57:59,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:57:59,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:57:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591177113] [2024-11-10 04:57:59,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:57:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:57:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:57:59,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:57:59,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:57:59,656 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 04:58:05,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:09,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:14,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:18,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:19,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:24,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:28,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:32,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:58:39,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []