./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-92.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 be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:55:59,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:55:59,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:55:59,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:55:59,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:55:59,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:55:59,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:55:59,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:55:59,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:55:59,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:55:59,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:55:59,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:55:59,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:55:59,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:55:59,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:55:59,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:55:59,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:55:59,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:55:59,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:55:59,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:55:59,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:55:59,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:55:59,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:55:59,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:55:59,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:55:59,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:55:59,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:55:59,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:55:59,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:55:59,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:55:59,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:55:59,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:55:59,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:55:59,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:55:59,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:55:59,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:55:59,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:55:59,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:55:59,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:55:59,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:55:59,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:55:59,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:55:59,834 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 -> be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 [2024-11-16 13:56:00,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:56:00,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:56:00,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:56:00,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:56:00,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:56:00,137 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-92.i [2024-11-16 13:56:01,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:56:01,834 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:56:01,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-16 13:56:01,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66bf1295/0cecef6a0e6b48ad8cdca83a0a5de471/FLAG445c994c0 [2024-11-16 13:56:01,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66bf1295/0cecef6a0e6b48ad8cdca83a0a5de471 [2024-11-16 13:56:01,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:56:01,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:56:01,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:56:01,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:56:01,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:56:01,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:56:01" (1/1) ... [2024-11-16 13:56:01,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7fb9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:01, skipping insertion in model container [2024-11-16 13:56:01,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:56:01" (1/1) ... [2024-11-16 13:56:01,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:56:02,093 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-92.i[919,932] [2024-11-16 13:56:02,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:56:02,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:56:02,214 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-92.i[919,932] [2024-11-16 13:56:02,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:56:02,271 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:56:02,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02 WrapperNode [2024-11-16 13:56:02,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:56:02,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:56:02,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:56:02,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:56:02,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,349 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-16 13:56:02,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:56:02,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:56:02,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:56:02,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:56:02,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,395 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-16 13:56:02,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:56:02,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:56:02,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:56:02,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:56:02,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (1/1) ... [2024-11-16 13:56:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:56:02,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:56:02,479 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-16 13:56:02,482 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-16 13:56:02,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:56:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:56:02,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:56:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:56:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:56:02,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:56:02,644 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:56:02,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:56:03,176 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2024-11-16 13:56:03,225 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 13:56:03,225 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:56:03,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:56:03,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:56:03,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:03 BoogieIcfgContainer [2024-11-16 13:56:03,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:56:03,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:56:03,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:56:03,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:56:03,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:56:01" (1/3) ... [2024-11-16 13:56:03,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12207eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:56:03, skipping insertion in model container [2024-11-16 13:56:03,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:02" (2/3) ... [2024-11-16 13:56:03,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12207eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:56:03, skipping insertion in model container [2024-11-16 13:56:03,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:03" (3/3) ... [2024-11-16 13:56:03,264 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-16 13:56:03,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:56:03,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:56:03,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:56:03,359 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;@5159ce3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:56:03,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:56:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:56:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:56:03,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:03,378 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:03,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:03,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1260473797, now seen corresponding path program 1 times [2024-11-16 13:56:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:03,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311639796] [2024-11-16 13:56:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:03,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311639796] [2024-11-16 13:56:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311639796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:56:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026123159] [2024-11-16 13:56:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:03,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:56:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:56:03,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:56:03,975 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:56:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:04,053 INFO L93 Difference]: Finished difference Result 198 states and 341 transitions. [2024-11-16 13:56:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:56:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-16 13:56:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:04,067 INFO L225 Difference]: With dead ends: 198 [2024-11-16 13:56:04,068 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 13:56:04,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-16 13:56:04,079 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:04,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:56:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 13:56:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-16 13:56:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:56:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-16 13:56:04,145 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 186 [2024-11-16 13:56:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:04,145 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-16 13:56:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:56:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-16 13:56:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:56:04,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:04,152 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:56:04,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1001315613, now seen corresponding path program 1 times [2024-11-16 13:56:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:04,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539717712] [2024-11-16 13:56:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539717712] [2024-11-16 13:56:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539717712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:56:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582209296] [2024-11-16 13:56:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:04,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:56:04,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:04,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:56:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:56:04,661 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:04,810 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-16 13:56:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:56:04,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-16 13:56:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:04,818 INFO L225 Difference]: With dead ends: 281 [2024-11-16 13:56:04,818 INFO L226 Difference]: Without dead ends: 186 [2024-11-16 13:56:04,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-16 13:56:04,823 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 130 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:04,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 597 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:56:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-16 13:56:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 104. [2024-11-16 13:56:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:56:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2024-11-16 13:56:04,855 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 186 [2024-11-16 13:56:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:04,857 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2024-11-16 13:56:04,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2024-11-16 13:56:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:56:04,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:04,864 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:04,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:56:04,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:04,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1294718620, now seen corresponding path program 1 times [2024-11-16 13:56:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520547154] [2024-11-16 13:56:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520547154] [2024-11-16 13:56:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520547154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:56:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844554416] [2024-11-16 13:56:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:05,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:56:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:56:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:56:05,224 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:05,334 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2024-11-16 13:56:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:56:05,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-16 13:56:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:05,337 INFO L225 Difference]: With dead ends: 259 [2024-11-16 13:56:05,337 INFO L226 Difference]: Without dead ends: 158 [2024-11-16 13:56:05,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:56:05,339 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 75 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:05,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 381 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:56:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-16 13:56:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-16 13:56:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 106 states have internal predecessors, (142), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 13:56:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2024-11-16 13:56:05,370 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 186 [2024-11-16 13:56:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:05,371 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2024-11-16 13:56:05,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2024-11-16 13:56:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:56:05,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:05,376 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:05,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:56:05,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:05,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1192794213, now seen corresponding path program 1 times [2024-11-16 13:56:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614841717] [2024-11-16 13:56:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:05,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614841717] [2024-11-16 13:56:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614841717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:56:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094142746] [2024-11-16 13:56:05,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:05,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:56:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:56:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:56:05,958 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:06,374 INFO L93 Difference]: Finished difference Result 517 states and 784 transitions. [2024-11-16 13:56:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:56:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-16 13:56:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:06,383 INFO L225 Difference]: With dead ends: 517 [2024-11-16 13:56:06,384 INFO L226 Difference]: Without dead ends: 366 [2024-11-16 13:56:06,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:56:06,388 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 169 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:06,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 709 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 13:56:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-16 13:56:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 303. [2024-11-16 13:56:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 208 states have internal predecessors, (278), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-16 13:56:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 462 transitions. [2024-11-16 13:56:06,444 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 462 transitions. Word has length 186 [2024-11-16 13:56:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:06,444 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 462 transitions. [2024-11-16 13:56:06,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 462 transitions. [2024-11-16 13:56:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-16 13:56:06,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:06,447 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:06,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:56:06,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:06,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1313156482, now seen corresponding path program 1 times [2024-11-16 13:56:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469959197] [2024-11-16 13:56:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469959197] [2024-11-16 13:56:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469959197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:08,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 13:56:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405207361] [2024-11-16 13:56:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:08,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 13:56:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 13:56:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-16 13:56:08,245 INFO L87 Difference]: Start difference. First operand 303 states and 462 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:08,941 INFO L93 Difference]: Finished difference Result 789 states and 1191 transitions. [2024-11-16 13:56:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:56:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-16 13:56:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:08,949 INFO L225 Difference]: With dead ends: 789 [2024-11-16 13:56:08,950 INFO L226 Difference]: Without dead ends: 489 [2024-11-16 13:56:08,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 13:56:08,952 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 172 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:08,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 661 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:56:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-16 13:56:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2024-11-16 13:56:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 322 states have (on average 1.3695652173913044) internal successors, (441), 324 states have internal predecessors, (441), 120 states have call successors, (120), 7 states have call predecessors, (120), 7 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-16 13:56:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 681 transitions. [2024-11-16 13:56:09,028 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 681 transitions. Word has length 187 [2024-11-16 13:56:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:09,031 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 681 transitions. [2024-11-16 13:56:09,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 681 transitions. [2024-11-16 13:56:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 13:56:09,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:09,034 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:09,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:56:09,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash 928428608, now seen corresponding path program 1 times [2024-11-16 13:56:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:09,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814349383] [2024-11-16 13:56:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 60 proven. 21 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 13:56:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814349383] [2024-11-16 13:56:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814349383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:56:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271807729] [2024-11-16 13:56:09,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:09,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:56:09,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:56:09,508 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-16 13:56:09,510 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-16 13:56:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:56:09,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 627 proven. 21 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-16 13:56:09,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:56:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 60 proven. 21 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 13:56:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271807729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:56:10,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:56:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 20 [2024-11-16 13:56:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913901790] [2024-11-16 13:56:10,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:56:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 13:56:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 13:56:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-16 13:56:10,430 INFO L87 Difference]: Start difference. First operand 450 states and 681 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-16 13:56:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:17,746 INFO L93 Difference]: Finished difference Result 3663 states and 5122 transitions. [2024-11-16 13:56:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2024-11-16 13:56:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 189 [2024-11-16 13:56:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:17,768 INFO L225 Difference]: With dead ends: 3663 [2024-11-16 13:56:17,768 INFO L226 Difference]: Without dead ends: 3284 [2024-11-16 13:56:17,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10729 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5461, Invalid=21599, Unknown=0, NotChecked=0, Total=27060 [2024-11-16 13:56:17,780 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 1690 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:17,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 2238 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 13:56:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2024-11-16 13:56:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2133. [2024-11-16 13:56:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1650 states have (on average 1.3387878787878789) internal successors, (2209), 1680 states have internal predecessors, (2209), 422 states have call successors, (422), 60 states have call predecessors, (422), 60 states have return successors, (422), 392 states have call predecessors, (422), 422 states have call successors, (422) [2024-11-16 13:56:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3053 transitions. [2024-11-16 13:56:18,005 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3053 transitions. Word has length 189 [2024-11-16 13:56:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:18,006 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 3053 transitions. [2024-11-16 13:56:18,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-16 13:56:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3053 transitions. [2024-11-16 13:56:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-16 13:56:18,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:18,012 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:18,032 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-16 13:56:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:56:18,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -81357561, now seen corresponding path program 1 times [2024-11-16 13:56:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102430110] [2024-11-16 13:56:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102430110] [2024-11-16 13:56:19,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102430110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:19,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:19,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 13:56:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747871491] [2024-11-16 13:56:19,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:19,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 13:56:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:19,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 13:56:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 13:56:19,273 INFO L87 Difference]: Start difference. First operand 2133 states and 3053 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:20,198 INFO L93 Difference]: Finished difference Result 4187 states and 5874 transitions. [2024-11-16 13:56:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 13:56:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-16 13:56:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:20,213 INFO L225 Difference]: With dead ends: 4187 [2024-11-16 13:56:20,213 INFO L226 Difference]: Without dead ends: 2487 [2024-11-16 13:56:20,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-16 13:56:20,220 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 319 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:20,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 949 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 13:56:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-11-16 13:56:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2084. [2024-11-16 13:56:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1601 states have (on average 1.3322923173016865) internal successors, (2133), 1631 states have internal predecessors, (2133), 422 states have call successors, (422), 60 states have call predecessors, (422), 60 states have return successors, (422), 392 states have call predecessors, (422), 422 states have call successors, (422) [2024-11-16 13:56:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2977 transitions. [2024-11-16 13:56:20,404 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2977 transitions. Word has length 190 [2024-11-16 13:56:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:20,405 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2977 transitions. [2024-11-16 13:56:20,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2977 transitions. [2024-11-16 13:56:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 13:56:20,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:20,409 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 13:56:20,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -122782861, now seen corresponding path program 1 times [2024-11-16 13:56:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485792206] [2024-11-16 13:56:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:56:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:56:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:56:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:56:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:56:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:56:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:56:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:56:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:56:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:56:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:56:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:56:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:56:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:56:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:56:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:56:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:56:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:56:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:56:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:56:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:56:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:56:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:56:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:56:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:56:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:56:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:56:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:56:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:56:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485792206] [2024-11-16 13:56:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485792206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:20,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 13:56:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70934141] [2024-11-16 13:56:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:56:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:56:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:56:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:56:20,927 INFO L87 Difference]: Start difference. First operand 2084 states and 2977 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:56:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:21,850 INFO L93 Difference]: Finished difference Result 6010 states and 8581 transitions. [2024-11-16 13:56:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:56:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2024-11-16 13:56:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:21,874 INFO L225 Difference]: With dead ends: 6010 [2024-11-16 13:56:21,874 INFO L226 Difference]: Without dead ends: 4366 [2024-11-16 13:56:21,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:56:21,883 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 386 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:21,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 878 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 13:56:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2024-11-16 13:56:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 4312. [2024-11-16 13:56:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3353 states have (on average 1.334327467939159) internal successors, (4474), 3413 states have internal predecessors, (4474), 834 states have call successors, (834), 124 states have call predecessors, (834), 124 states have return successors, (834), 774 states have call predecessors, (834), 834 states have call successors, (834) [2024-11-16 13:56:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 6142 transitions. [2024-11-16 13:56:22,249 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 6142 transitions. Word has length 191 [2024-11-16 13:56:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 6142 transitions. [2024-11-16 13:56:22,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:56:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 6142 transitions. [2024-11-16 13:56:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 13:56:22,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:22,255 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:22,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 13:56:22,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:22,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2094975092, now seen corresponding path program 1 times [2024-11-16 13:56:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:56:22,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101738819] [2024-11-16 13:56:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:56:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:56:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183320370] [2024-11-16 13:56:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:22,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:56:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:56:22,333 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-16 13:56:22,334 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-16 13:56:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:56:22,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:56:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:56:22,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:56:22,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:56:22,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:56:22,718 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-16 13:56:22,899 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,SelfDestructingSolverStorable8 [2024-11-16 13:56:22,902 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:23,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:56:23,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:56:23 BoogieIcfgContainer [2024-11-16 13:56:23,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:56:23,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:56:23,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:56:23,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:56:23,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:03" (3/4) ... [2024-11-16 13:56:23,055 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:56:23,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:56:23,057 INFO L158 Benchmark]: Toolchain (without parser) took 21186.01ms. Allocated memory was 163.6MB in the beginning and 459.3MB in the end (delta: 295.7MB). Free memory was 90.9MB in the beginning and 397.9MB in the end (delta: -307.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:56:23,057 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:56:23,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.70ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 73.2MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 13:56:23,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.52ms. Allocated memory is still 163.6MB. Free memory was 73.2MB in the beginning and 67.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:56:23,058 INFO L158 Benchmark]: Boogie Preprocessor took 93.17ms. Allocated memory is still 163.6MB. Free memory was 67.9MB in the beginning and 62.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:56:23,059 INFO L158 Benchmark]: IcfgBuilder took 808.21ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 61.6MB in the beginning and 160.3MB in the end (delta: -98.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-16 13:56:23,059 INFO L158 Benchmark]: TraceAbstraction took 19796.08ms. Allocated memory was 218.1MB in the beginning and 459.3MB in the end (delta: 241.2MB). Free memory was 159.3MB in the beginning and 399.0MB in the end (delta: -239.7MB). Peak memory consumption was 253.6MB. Max. memory is 16.1GB. [2024-11-16 13:56:23,059 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 459.3MB. Free memory is still 397.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:56:23,061 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.13ms. Allocated memory is still 163.6MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.70ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 73.2MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.52ms. Allocated memory is still 163.6MB. Free memory was 73.2MB in the beginning and 67.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.17ms. Allocated memory is still 163.6MB. Free memory was 67.9MB in the beginning and 62.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 808.21ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 61.6MB in the beginning and 160.3MB in the end (delta: -98.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19796.08ms. Allocated memory was 218.1MB in the beginning and 459.3MB in the end (delta: 241.2MB). Free memory was 159.3MB in the beginning and 399.0MB in the end (delta: -239.7MB). Peak memory consumption was 253.6MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 459.3MB. Free memory is still 397.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of shiftRight at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int var_1_28 = 16; [L42] signed short int var_1_30 = -256; [L43] signed short int var_1_32 = 8; [L44] unsigned short int var_1_33 = 128; [L45] double var_1_34 = 0.25; [L46] signed long int var_1_36 = -32; [L47] unsigned char var_1_38 = 0; [L48] unsigned char var_1_39 = 1; [L49] float var_1_40 = 2.6; [L50] unsigned char var_1_41 = 0; [L51] unsigned char var_1_42 = 0; [L52] unsigned short int last_1_var_1_1 = 100; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_13 = 8.25; [L55] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L140] var_1_6 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L146] var_1_8 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L148] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L149] var_1_9 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535] [L150] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535] [L151] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L151] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L153] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L156] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L161] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L162] var_1_15 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L164] var_1_18 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L166] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L167] var_1_19 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L168] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L169] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L170] var_1_21 = __VERIFIER_nondet_long() [L171] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L171] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L172] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L174] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L175] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L176] var_1_39 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L177] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L178] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L179] var_1_42 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L180] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L181] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L198] RET updateVariables() [L199] CALL step() [L59] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=1, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L60] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L71] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L73] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L73] COND FALSE !((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) [L78] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L79] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L80] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L83] COND FALSE !((~ var_1_19) == stepLocal_4) [L86] var_1_20 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L89] unsigned char stepLocal_3 = var_1_6; [L90] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=0, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L91] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L96] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L98] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32767, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L99] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L100] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L104] COND TRUE (var_1_20 + var_1_20) > 16 [L105] var_1_23 = ((var_1_26 + 2) + var_1_18) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L113] var_1_28 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L114] COND TRUE var_1_16 < 2 [L115] var_1_30 = (((((((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) > (var_1_12)) ? (((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) : (var_1_12))) + var_1_19) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L119] EXPR var_1_11 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L119] COND FALSE !((~ (var_1_11 | var_1_20)) >= (~ (~ 32))) [L122] EXPR var_1_19 >> var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L122] COND FALSE !((var_1_19 >> var_1_18) <= var_1_18) [L127] COND FALSE !(var_1_12 >= var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L132] COND FALSE !(((var_1_8 - var_1_19) > var_1_8) && var_1_6) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L135] var_1_38 = var_1_39 [L136] var_1_40 = var_1_15 [L137] var_1_41 = var_1_42 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L190] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L190-L191] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2962 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2941 mSDsluCounter, 6560 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4948 mSDsCounter, 1230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4377 IncrementalHoareTripleChecker+Invalid, 5607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1230 mSolverCounterUnsat, 1612 mSDtfsCounter, 4377 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10761 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4312occurred in iteration=8, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 1796 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2072 NumberOfCodeBlocks, 2072 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1869 ConstructedInterpolants, 0 QuantifiedInterpolants, 8854 SizeOfPredicates, 8 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 15057/15120 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-16 13:56:23,128 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-92.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 be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:56:25,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:56:25,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:56:25,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:56:25,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:56:25,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:56:25,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:56:25,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:56:25,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:56:25,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:56:25,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:56:25,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:56:25,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:56:25,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:56:25,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:56:25,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:56:25,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:56:25,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:56:25,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:56:25,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:56:25,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:56:25,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:56:25,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:56:25,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:56:25,466 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:56:25,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:56:25,466 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:56:25,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:56:25,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:56:25,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:56:25,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:56:25,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:56:25,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:56:25,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:56:25,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:56:25,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:56:25,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:56:25,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:56:25,470 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:56:25,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:56:25,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:56:25,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:56:25,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:56:25,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:56:25,472 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 -> be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 [2024-11-16 13:56:25,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:56:25,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:56:25,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:56:25,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:56:25,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:56:25,850 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-92.i [2024-11-16 13:56:27,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:56:27,609 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:56:27,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-16 13:56:27,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ce9ef39/17d645e1aca54331bb9eb49c193f9832/FLAG717bd102f [2024-11-16 13:56:27,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ce9ef39/17d645e1aca54331bb9eb49c193f9832 [2024-11-16 13:56:27,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:56:27,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:56:27,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:56:27,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:56:27,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:56:27,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:56:27" (1/1) ... [2024-11-16 13:56:27,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a8e0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:27, skipping insertion in model container [2024-11-16 13:56:27,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:56:27" (1/1) ... [2024-11-16 13:56:27,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:56:27,901 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-92.i[919,932] [2024-11-16 13:56:27,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:56:28,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:56:28,022 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-92.i[919,932] [2024-11-16 13:56:28,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:56:28,100 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:56:28,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28 WrapperNode [2024-11-16 13:56:28,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:56:28,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:56:28,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:56:28,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:56:28,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,165 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-16 13:56:28,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:56:28,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:56:28,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:56:28,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:56:28,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,209 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-16 13:56:28,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:56:28,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:56:28,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:56:28,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:56:28,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (1/1) ... [2024-11-16 13:56:28,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:56:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:56:28,283 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-16 13:56:28,285 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-16 13:56:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:56:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:56:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:56:28,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:56:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:56:28,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:56:28,414 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:56:28,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:56:29,018 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 13:56:29,018 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:56:29,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:56:29,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:56:29,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:29 BoogieIcfgContainer [2024-11-16 13:56:29,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:56:29,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:56:29,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:56:29,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:56:29,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:56:27" (1/3) ... [2024-11-16 13:56:29,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4944ca8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:56:29, skipping insertion in model container [2024-11-16 13:56:29,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:28" (2/3) ... [2024-11-16 13:56:29,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4944ca8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:56:29, skipping insertion in model container [2024-11-16 13:56:29,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:29" (3/3) ... [2024-11-16 13:56:29,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-16 13:56:29,083 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:56:29,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:56:29,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:56:29,166 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;@62fdf1fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:56:29,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:56:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:56:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 13:56:29,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:29,188 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:29,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:29,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 487258892, now seen corresponding path program 1 times [2024-11-16 13:56:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403905430] [2024-11-16 13:56:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:29,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:29,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:29,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:56:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:29,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:56:29,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-16 13:56:29,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:56:29,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403905430] [2024-11-16 13:56:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403905430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:29,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:29,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:56:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742790601] [2024-11-16 13:56:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:29,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:56:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:56:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:56:29,614 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:56:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:29,656 INFO L93 Difference]: Finished difference Result 168 states and 295 transitions. [2024-11-16 13:56:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:56:29,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2024-11-16 13:56:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:29,667 INFO L225 Difference]: With dead ends: 168 [2024-11-16 13:56:29,667 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 13:56:29,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:56:29,677 INFO L432 NwaCegarLoop]: 128 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, 128 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-16 13:56:29,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:56:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 13:56:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-16 13:56:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:56:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-16 13:56:29,738 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 181 [2024-11-16 13:56:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:29,738 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-16 13:56:29,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:56:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-16 13:56:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 13:56:29,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:29,746 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:29,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 13:56:29,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:29,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1288312018, now seen corresponding path program 1 times [2024-11-16 13:56:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:29,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768084685] [2024-11-16 13:56:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:29,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:29,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:29,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:29,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:56:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:30,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 13:56:30,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:56:30,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:56:30,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768084685] [2024-11-16 13:56:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768084685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:56:30,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401357744] [2024-11-16 13:56:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:30,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:56:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:56:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:56:30,775 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:31,853 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2024-11-16 13:56:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:56:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-16 13:56:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:31,864 INFO L225 Difference]: With dead ends: 265 [2024-11-16 13:56:31,864 INFO L226 Difference]: Without dead ends: 185 [2024-11-16 13:56:31,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 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-16 13:56:31,866 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 115 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:31,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 387 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 13:56:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-16 13:56:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2024-11-16 13:56:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:56:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 249 transitions. [2024-11-16 13:56:31,920 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 249 transitions. Word has length 181 [2024-11-16 13:56:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:31,925 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 249 transitions. [2024-11-16 13:56:31,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:56:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 249 transitions. [2024-11-16 13:56:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 13:56:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:31,931 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:31,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:56:32,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:32,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:32,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1792208311, now seen corresponding path program 1 times [2024-11-16 13:56:32,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:32,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319257117] [2024-11-16 13:56:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:32,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:32,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:32,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:56:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:32,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 13:56:32,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1023 proven. 78 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-11-16 13:56:33,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:56:33,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319257117] [2024-11-16 13:56:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319257117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:56:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [882147435] [2024-11-16 13:56:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:33,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 13:56:33,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 13:56:33,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 13:56:33,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-16 13:56:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:34,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 13:56:34,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 636 proven. 36 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 13:56:34,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:56:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [882147435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:56:35,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:56:35,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2024-11-16 13:56:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282300786] [2024-11-16 13:56:35,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:56:35,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 13:56:35,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:35,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 13:56:35,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-16 13:56:35,527 INFO L87 Difference]: Start difference. First operand 160 states and 249 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (44), 6 states have call predecessors, (44), 8 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-16 13:56:40,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 13:56:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:40,531 INFO L93 Difference]: Finished difference Result 397 states and 589 transitions. [2024-11-16 13:56:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 13:56:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (44), 6 states have call predecessors, (44), 8 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) Word has length 182 [2024-11-16 13:56:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:40,537 INFO L225 Difference]: With dead ends: 397 [2024-11-16 13:56:40,537 INFO L226 Difference]: Without dead ends: 240 [2024-11-16 13:56:40,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2024-11-16 13:56:40,542 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 231 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:40,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 529 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-16 13:56:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-16 13:56:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2024-11-16 13:56:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 149 states have internal predecessors, (191), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 13:56:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 323 transitions. [2024-11-16 13:56:40,583 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 323 transitions. Word has length 182 [2024-11-16 13:56:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:40,584 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 323 transitions. [2024-11-16 13:56:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (44), 6 states have call predecessors, (44), 8 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-16 13:56:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 323 transitions. [2024-11-16 13:56:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:56:40,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:40,588 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:56:40,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 13:56:40,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-16 13:56:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 13:56:40,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:40,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -363317968, now seen corresponding path program 1 times [2024-11-16 13:56:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339164088] [2024-11-16 13:56:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:40,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:40,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:40,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:40,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 13:56:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:41,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 13:56:41,267 INFO L278 TraceCheckSpWp]: Computing forward predicates...