./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.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 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:50:46,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:50:46,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:50:46,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:50:46,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:50:46,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:50:46,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:50:46,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:50:46,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:50:46,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:50:46,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:50:46,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:50:46,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:50:46,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:50:46,541 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:50:46,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:50:46,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:50:46,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:50:46,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:50:46,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:50:46,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:50:46,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:50:46,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:50:46,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:50:46,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:50:46,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:50:46,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:50:46,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:50:46,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:50:46,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:50:46,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:50:46,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:50:46,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:50:46,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:50:46,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:50:46,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:50:46,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:50:46,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:50:46,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:50:46,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:50:46,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:50:46,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:50:46,551 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 -> 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 [2024-11-12 02:50:46,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:50:46,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:50:46,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:50:46,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:50:46,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:50:46,763 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-54.i [2024-11-12 02:50:47,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:50:48,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:50:48,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-12 02:50:48,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34018e036/5ca68803cda94b9b9691aaec611545eb/FLAGb58901591 [2024-11-12 02:50:48,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34018e036/5ca68803cda94b9b9691aaec611545eb [2024-11-12 02:50:48,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:50:48,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:50:48,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:50:48,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:50:48,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:50:48,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe82898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48, skipping insertion in model container [2024-11-12 02:50:48,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:50:48,702 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-54.i[919,932] [2024-11-12 02:50:48,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:50:48,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:50:48,792 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-54.i[919,932] [2024-11-12 02:50:48,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:50:48,840 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:50:48,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48 WrapperNode [2024-11-12 02:50:48,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:50:48,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:50:48,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:50:48,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:50:48,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,881 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-12 02:50:48,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:50:48,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:50:48,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:50:48,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:50:48,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:50:48,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:50:48,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:50:48,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:50:48,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:50:48,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (1/1) ... [2024-11-12 02:50:48,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:50:48,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:50:48,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:50:48,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:50:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:50:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:50:48,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:50:48,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:50:48,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:50:48,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:50:49,073 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:50:49,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:50:49,410 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 02:50:49,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:50:49,424 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:50:49,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:50:49,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:50:49 BoogieIcfgContainer [2024-11-12 02:50:49,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:50:49,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:50:49,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:50:49,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:50:49,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:50:48" (1/3) ... [2024-11-12 02:50:49,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f26b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:50:49, skipping insertion in model container [2024-11-12 02:50:49,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:50:48" (2/3) ... [2024-11-12 02:50:49,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f26b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:50:49, skipping insertion in model container [2024-11-12 02:50:49,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:50:49" (3/3) ... [2024-11-12 02:50:49,435 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-12 02:50:49,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:50:49,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:50:49,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:50:49,521 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;@2c73d792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:50:49,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:50:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:50:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 02:50:49,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:50:49,537 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:50:49,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:50:49,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:50:49,542 INFO L85 PathProgramCache]: Analyzing trace with hash 756435362, now seen corresponding path program 1 times [2024-11-12 02:50:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:50:49,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911093829] [2024-11-12 02:50:49,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:50:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:50:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:50:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:50:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:50:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:50:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:50:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:50:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:50:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:50:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:50:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:50:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:50:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:50:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:50:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:50:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:50:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:50:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:50:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:50:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:50:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:50:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 02:50:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:50:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 02:50:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:50:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:50:49,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:50:49,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911093829] [2024-11-12 02:50:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911093829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:50:49,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:50:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:50:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465912296] [2024-11-12 02:50:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:50:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:50:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:50:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:50:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:50:50,047 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 02:50:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:50:50,072 INFO L93 Difference]: Finished difference Result 163 states and 285 transitions. [2024-11-12 02:50:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:50:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-12 02:50:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:50:50,085 INFO L225 Difference]: With dead ends: 163 [2024-11-12 02:50:50,086 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 02:50:50,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:50:50,094 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:50:50,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:50:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 02:50:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 02:50:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:50:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-12 02:50:50,139 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 167 [2024-11-12 02:50:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:50:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-12 02:50:50,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 02:50:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-12 02:50:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 02:50:50,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:50:50,146 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:50:50,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:50:50,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:50:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:50:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1461536544, now seen corresponding path program 1 times [2024-11-12 02:50:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:50:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150877020] [2024-11-12 02:50:50,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:50:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:50:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:50:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:50:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:50:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:50:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:50:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:50:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:50:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:50:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:50:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:50:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:50:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:50:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:50:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:50:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:50:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:50:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:50:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:50:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:50:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:50:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 02:50:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:50:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 02:50:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:50:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:50:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:50:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150877020] [2024-11-12 02:50:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150877020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:50:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:50:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:50:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374879590] [2024-11-12 02:50:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:50:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:50:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:50:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:50:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:50:50,523 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:50:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:50:50,646 INFO L93 Difference]: Finished difference Result 200 states and 303 transitions. [2024-11-12 02:50:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:50:50,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 02:50:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:50:50,649 INFO L225 Difference]: With dead ends: 200 [2024-11-12 02:50:50,649 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 02:50:50,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:50:50,650 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 69 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:50:50,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 319 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:50:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 02:50:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2024-11-12 02:50:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 02:50:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2024-11-12 02:50:50,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 167 [2024-11-12 02:50:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:50:50,689 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2024-11-12 02:50:50,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:50:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2024-11-12 02:50:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 02:50:50,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:50:50,691 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:50:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:50:50,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:50:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:50:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -200664608, now seen corresponding path program 1 times [2024-11-12 02:50:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:50:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898514451] [2024-11-12 02:50:50,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:50:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:50:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:50:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:50:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:50:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:50:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:50:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:50:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:50:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:50:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:50:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:50:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:50:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:50:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:50:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:50:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:50:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:50:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:50:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:50:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:50:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:50:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 02:50:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:50:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 02:50:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:50:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:50:51,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:50:51,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898514451] [2024-11-12 02:50:51,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898514451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:50:51,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:50:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:50:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402039662] [2024-11-12 02:50:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:50:51,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:50:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:50:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:50:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:50:51,067 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:50:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:50:51,222 INFO L93 Difference]: Finished difference Result 289 states and 443 transitions. [2024-11-12 02:50:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:50:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 02:50:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:50:51,225 INFO L225 Difference]: With dead ends: 289 [2024-11-12 02:50:51,227 INFO L226 Difference]: Without dead ends: 193 [2024-11-12 02:50:51,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:50:51,229 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:50:51,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 361 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:50:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-12 02:50:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2024-11-12 02:50:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 94 states have internal predecessors, (121), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 02:50:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2024-11-12 02:50:51,260 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 167 [2024-11-12 02:50:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:50:51,261 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2024-11-12 02:50:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:50:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2024-11-12 02:50:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 02:50:51,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:50:51,263 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:50:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:50:51,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:50:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:50:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1833825476, now seen corresponding path program 1 times [2024-11-12 02:50:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:50:51,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666136513] [2024-11-12 02:50:51,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:50:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:50:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:50:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:50:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:50:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:50:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:50:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:50:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:50:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:50:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:50:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:50:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:50:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:50:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:50:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:50:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:50:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:50:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:50:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:50:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:50:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:50:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 02:50:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:50:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 02:50:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:50:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:50:51,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:50:51,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666136513] [2024-11-12 02:50:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666136513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:50:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:50:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:50:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839574801] [2024-11-12 02:50:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:50:51,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:50:51,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:50:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:50:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:50:51,532 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:50:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:50:51,585 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2024-11-12 02:50:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:50:51,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-12 02:50:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:50:51,587 INFO L225 Difference]: With dead ends: 251 [2024-11-12 02:50:51,590 INFO L226 Difference]: Without dead ends: 155 [2024-11-12 02:50:51,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:50:51,591 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:50:51,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 330 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:50:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-12 02:50:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-12 02:50:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.305263157894737) internal successors, (124), 96 states have internal predecessors, (124), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 02:50:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2024-11-12 02:50:51,623 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 168 [2024-11-12 02:50:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:50:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2024-11-12 02:50:51,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 02:50:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2024-11-12 02:50:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 02:50:51,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:50:51,630 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:50:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:50:51,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:50:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:50:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1781083450, now seen corresponding path program 1 times [2024-11-12 02:50:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:50:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581071179] [2024-11-12 02:50:51,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:50:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:50:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:50:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:50:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:50:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:50:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:50:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:50:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:50:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:50:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:50:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:50:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:50:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:50:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:50:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:50:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:50:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:50:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:50:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:50:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:50:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:50:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 02:50:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:50:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 02:50:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:50:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 02:50:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:50:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581071179] [2024-11-12 02:50:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581071179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:50:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918258010] [2024-11-12 02:50:51,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:50:51,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:50:51,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:50:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 02:50:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:52,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:50:52,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:50:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-12 02:50:52,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:50:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 02:50:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918258010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:50:52,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:50:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 02:50:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480299740] [2024-11-12 02:50:52,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:50:52,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:50:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:50:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:50:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:50:52,511 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-12 02:50:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:50:52,706 INFO L93 Difference]: Finished difference Result 262 states and 389 transitions. [2024-11-12 02:50:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 02:50:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 168 [2024-11-12 02:50:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:50:52,708 INFO L225 Difference]: With dead ends: 262 [2024-11-12 02:50:52,708 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 02:50:52,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 02:50:52,709 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:50:52,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 287 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:50:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 02:50:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2024-11-12 02:50:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 102 states have internal predecessors, (128), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 02:50:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-12 02:50:52,729 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 168 [2024-11-12 02:50:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:50:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-12 02:50:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-12 02:50:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-12 02:50:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 02:50:52,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:50:52,732 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:50:52,746 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-12 02:50:52,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:50:52,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:50:52,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:50:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1704537220, now seen corresponding path program 1 times [2024-11-12 02:50:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:50:52,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013631911] [2024-11-12 02:50:52,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:50:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:50:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844476840] [2024-11-12 02:50:53,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:50:53,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:50:53,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:50:53,049 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-12 02:50:53,050 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-12 02:50:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:50:53,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 02:50:53,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:50:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 715 proven. 312 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-12 02:50:58,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:51:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013631911] [2024-11-12 02:51:43,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 02:51:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844476840] [2024-11-12 02:51:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844476840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:51:43,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 02:51:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2024-11-12 02:51:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498224282] [2024-11-12 02:51:43,042 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 02:51:43,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 02:51:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 02:51:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1539, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 02:51:43,044 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 9 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2024-11-12 02:52:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:52:04,134 INFO L93 Difference]: Finished difference Result 551 states and 762 transitions. [2024-11-12 02:52:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-12 02:52:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 9 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) Word has length 168 [2024-11-12 02:52:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:52:04,137 INFO L225 Difference]: With dead ends: 551 [2024-11-12 02:52:04,137 INFO L226 Difference]: Without dead ends: 449 [2024-11-12 02:52:04,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=611, Invalid=2581, Unknown=0, NotChecked=0, Total=3192 [2024-11-12 02:52:04,138 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 696 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 11 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:52:04,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 593 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1246 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2024-11-12 02:52:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-12 02:52:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 216. [2024-11-12 02:52:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.193103448275862) internal successors, (173), 145 states have internal predecessors, (173), 50 states have call successors, (50), 20 states have call predecessors, (50), 20 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 02:52:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2024-11-12 02:52:04,165 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 168 [2024-11-12 02:52:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:52:04,166 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2024-11-12 02:52:04,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 9 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2024-11-12 02:52:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2024-11-12 02:52:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 02:52:04,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:52:04,170 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:52:04,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 02:52:04,371 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,SelfDestructingSolverStorable5 [2024-11-12 02:52:04,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:52:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:52:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1117731206, now seen corresponding path program 1 times [2024-11-12 02:52:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:52:04,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720132047] [2024-11-12 02:52:04,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:52:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:52:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:52:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:52:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:52:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:52:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:52:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:52:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:52:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:52:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:52:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:52:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:52:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:52:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:52:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:52:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:52:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:52:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:52:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:52:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:52:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:52:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:52:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 02:52:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:52:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 02:52:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:52:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 96 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-11-12 02:52:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:52:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720132047] [2024-11-12 02:52:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720132047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:52:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588715421] [2024-11-12 02:52:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:52:05,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:52:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:52:05,135 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-12 02:52:05,136 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-12 02:52:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:52:05,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 02:52:05,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:52:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 652 proven. 144 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-12 02:52:06,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:52:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588715421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:52:08,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:52:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 22 [2024-11-12 02:52:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930823821] [2024-11-12 02:52:08,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:52:08,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 02:52:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:52:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 02:52:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 02:52:08,899 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand has 22 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (49), 6 states have call predecessors, (49), 7 states have call successors, (49) [2024-11-12 02:52:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:52:11,337 INFO L93 Difference]: Finished difference Result 669 states and 878 transitions. [2024-11-12 02:52:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-12 02:52:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (49), 6 states have call predecessors, (49), 7 states have call successors, (49) Word has length 168 [2024-11-12 02:52:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:52:11,340 INFO L225 Difference]: With dead ends: 669 [2024-11-12 02:52:11,340 INFO L226 Difference]: Without dead ends: 539 [2024-11-12 02:52:11,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=680, Invalid=2626, Unknown=0, NotChecked=0, Total=3306 [2024-11-12 02:52:11,342 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1004 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:52:11,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 838 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 02:52:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-12 02:52:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 313. [2024-11-12 02:52:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 216 states have (on average 1.2037037037037037) internal successors, (260), 217 states have internal predecessors, (260), 65 states have call successors, (65), 31 states have call predecessors, (65), 31 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-12 02:52:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 390 transitions. [2024-11-12 02:52:11,388 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 390 transitions. Word has length 168 [2024-11-12 02:52:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:52:11,389 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 390 transitions. [2024-11-12 02:52:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (49), 6 states have call predecessors, (49), 7 states have call successors, (49) [2024-11-12 02:52:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 390 transitions. [2024-11-12 02:52:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 02:52:11,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:52:11,391 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:52:11,405 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-12 02:52:11,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:52:11,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:52:11,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:52:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash -289607486, now seen corresponding path program 1 times [2024-11-12 02:52:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:52:11,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33679798] [2024-11-12 02:52:11,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:52:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:52:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:52:11,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597049226] [2024-11-12 02:52:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:52:11,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:52:11,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:52:11,692 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-12 02:52:11,692 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-12 02:52:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:52:11,801 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:52:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:52:11,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:52:11,922 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:52:11,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:52:11,942 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-12 02:52:12,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:52:12,131 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:52:12,242 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:52:12,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:52:12 BoogieIcfgContainer [2024-11-12 02:52:12,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:52:12,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:52:12,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:52:12,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:52:12,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:50:49" (3/4) ... [2024-11-12 02:52:12,248 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:52:12,249 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:52:12,250 INFO L158 Benchmark]: Toolchain (without parser) took 83720.86ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 152.8MB in the beginning and 149.2MB in the end (delta: 3.6MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2024-11-12 02:52:12,250 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:52:12,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.18ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 135.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 02:52:12,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.42ms. Allocated memory is still 184.5MB. Free memory was 135.6MB in the beginning and 132.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 02:52:12,251 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 129.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:52:12,251 INFO L158 Benchmark]: RCFGBuilder took 502.33ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 106.2MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 02:52:12,251 INFO L158 Benchmark]: TraceAbstraction took 82817.89ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 105.6MB in the beginning and 149.2MB in the end (delta: -43.6MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-12 02:52:12,251 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 268.4MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:52:12,253 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.14ms. Allocated memory is still 130.0MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.18ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 135.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.42ms. Allocated memory is still 184.5MB. Free memory was 135.6MB in the beginning and 132.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 129.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 502.33ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 106.2MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 82817.89ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 105.6MB in the beginning and 149.2MB in the end (delta: -43.6MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 268.4MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someUnaryFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] float var_1_23 = 4.8; [L42] float var_1_25 = 1000000.2; [L43] unsigned short int var_1_33 = 1; [L44] signed long int var_1_35 = 10; [L45] signed char var_1_36 = -16; [L46] signed char var_1_38 = 32; [L47] signed char var_1_39 = 5; [L48] signed long int var_1_40 = 32; [L49] signed char var_1_43 = -100; [L50] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L165] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L123] var_1_4 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L124] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L125] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L126] var_1_5 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L127] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L128] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L129] var_1_8 = __VERIFIER_nondet_short() [L130] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L132] var_1_10 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L136] var_1_11 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L139] var_1_12 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L142] var_1_15 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L144] var_1_16 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L145] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L146] var_1_17 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L149] var_1_19 = __VERIFIER_nondet_float() [L150] 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_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L150] 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_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L151] var_1_20 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L153] var_1_21 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L155] var_1_22 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L157] var_1_38 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_38 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_38 >= -127) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L159] CALL assume_abort_if_not(var_1_38 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L159] RET assume_abort_if_not(var_1_38 <= 126) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L160] var_1_39 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_39 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_39 >= -127) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_39 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_39 <= 126) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L176] RET updateVariables() [L177] CALL step() [L54] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L55] COND FALSE !(var_1_5 == var_1_4) [L58] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L63] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L70] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L72] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L73] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L75] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=-2147483650, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L76] COND FALSE !(((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0) [L79] var_1_9 = (! var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L81] COND TRUE var_1_18 > var_1_18 [L82] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L86] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=0, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L87] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1 [L88] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L90] COND TRUE var_1_8 > -64 [L91] var_1_23 = ((((49.2f) > (63.125f)) ? (49.2f) : (63.125f))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=246/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L93] COND TRUE var_1_4 >= var_1_8 [L94] var_1_25 = (((((((((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) < 0 ) ? -((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) : ((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19)))))) > (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) ? ((((((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) < 0 ) ? -((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) : ((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19)))))) : (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L98] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L99] EXPR var_1_14 >> var_1_8 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L99] EXPR var_1_5 ^ (var_1_14 >> var_1_8) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L99] COND FALSE !((var_1_5 ^ (var_1_14 >> var_1_8)) < var_1_14) [L102] COND FALSE !(! var_1_11) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L105] COND TRUE var_1_14 >= var_1_5 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L106] COND TRUE var_1_22 >= (var_1_16 - var_1_15) [L107] var_1_40 = ((((((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))) < 0 ) ? -(((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))) : (((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L114] COND FALSE !((var_1_38 < var_1_8) && (var_1_21 != var_1_16)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L177] RET step() [L178] CALL, EXPR property() [L168-L169] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 82.6s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1936 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1911 mSDsluCounter, 2854 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2044 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3337 IncrementalHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 810 mSDtfsCounter, 3337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 1106 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=7, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 532 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 55.9s InterpolantComputationTime, 2013 NumberOfCodeBlocks, 2013 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1667 ConstructedInterpolants, 7 QuantifiedInterpolants, 9474 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 11313/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 02:52:12,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.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 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:52:14,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:52:14,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:52:14,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:52:14,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:52:14,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:52:14,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:52:14,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:52:14,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:52:14,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:52:14,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:52:14,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:52:14,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:52:14,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:52:14,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:52:14,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:52:14,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:52:14,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:52:14,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:52:14,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:52:14,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:52:14,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:52:14,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:52:14,140 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:52:14,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:52:14,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:52:14,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:52:14,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:52:14,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:52:14,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:52:14,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:52:14,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:52:14,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:52:14,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:52:14,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:52:14,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:52:14,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:52:14,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:52:14,144 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:52:14,144 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:52:14,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:52:14,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:52:14,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:52:14,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:52:14,149 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 -> 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 [2024-11-12 02:52:14,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:52:14,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:52:14,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:52:14,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:52:14,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:52:14,425 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-54.i [2024-11-12 02:52:15,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:52:15,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:52:15,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-12 02:52:15,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a23470a/8c79d958467049d49ff9033d5f828619/FLAG387981eb8 [2024-11-12 02:52:15,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a23470a/8c79d958467049d49ff9033d5f828619 [2024-11-12 02:52:15,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:52:15,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:52:15,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:52:15,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:52:15,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:52:15,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:52:15" (1/1) ... [2024-11-12 02:52:15,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea613b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:15, skipping insertion in model container [2024-11-12 02:52:15,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:52:15" (1/1) ... [2024-11-12 02:52:16,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:52:16,146 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-54.i[919,932] [2024-11-12 02:52:16,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:52:16,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:52:16,267 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-54.i[919,932] [2024-11-12 02:52:16,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:52:16,327 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:52:16,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16 WrapperNode [2024-11-12 02:52:16,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:52:16,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:52:16,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:52:16,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:52:16,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,378 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-12 02:52:16,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:52:16,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:52:16,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:52:16,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:52:16,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:52:16,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:52:16,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:52:16,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:52:16,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:52:16,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:52:16" (1/1) ... [2024-11-12 02:52:16,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:52:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:52:16,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:52:16,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:52:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:52:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:52:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:52:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:52:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:52:16,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:52:16,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:52:16,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation