./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.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 ff10e4ea0b990784e69c3ecfa7bc5bb719f5fb9fd6950865d1eda8efa10d05f0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:56:21,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:56:21,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:56:21,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:56:21,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:56:21,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:56:21,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:56:21,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:56:21,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:56:21,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:56:21,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:56:21,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:56:21,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:56:21,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:56:21,290 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:56:21,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:56:21,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:56:21,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:56:21,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:56:21,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:56:21,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:56:21,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:56:21,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:56:21,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:56:21,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:56:21,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:56:21,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:56:21,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:56:21,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:56:21,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:56:21,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:56:21,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:56:21,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:56:21,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:56:21,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:56:21,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:56:21,299 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 -> ff10e4ea0b990784e69c3ecfa7bc5bb719f5fb9fd6950865d1eda8efa10d05f0 [2024-10-24 07:56:21,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:56:21,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:56:21,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:56:21,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:56:21,551 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:56:21,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i [2024-10-24 07:56:22,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:56:23,096 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:56:23,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i [2024-10-24 07:56:23,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59171f316/8979a3d28b754eb38972a6412e665a29/FLAG84558ba58 [2024-10-24 07:56:23,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59171f316/8979a3d28b754eb38972a6412e665a29 [2024-10-24 07:56:23,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:56:23,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:56:23,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:56:23,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:56:23,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:56:23,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a335955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23, skipping insertion in model container [2024-10-24 07:56:23,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:56:23,349 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i[918,931] [2024-10-24 07:56:23,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:56:23,440 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:56:23,450 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i[918,931] [2024-10-24 07:56:23,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:56:23,541 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:56:23,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23 WrapperNode [2024-10-24 07:56:23,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:56:23,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:56:23,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:56:23,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:56:23,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,645 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-24 07:56:23,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:56:23,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:56:23,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:56:23,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:56:23,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:56:23,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:56:23,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:56:23,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:56:23,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:56:23,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (1/1) ... [2024-10-24 07:56:23,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:56:23,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:56:23,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:56:23,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:56:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:56:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:56:23,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:56:23,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:56:23,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:56:23,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:56:23,927 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:56:23,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:56:24,322 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:56:24,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:56:24,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:56:24,379 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:56:24,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:56:24 BoogieIcfgContainer [2024-10-24 07:56:24,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:56:24,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:56:24,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:56:24,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:56:24,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:56:23" (1/3) ... [2024-10-24 07:56:24,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3697bf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:56:24, skipping insertion in model container [2024-10-24 07:56:24,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:23" (2/3) ... [2024-10-24 07:56:24,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3697bf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:56:24, skipping insertion in model container [2024-10-24 07:56:24,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:56:24" (3/3) ... [2024-10-24 07:56:24,395 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i [2024-10-24 07:56:24,422 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:56:24,422 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:56:24,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:56:24,495 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;@437ec51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:56:24,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:56:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:56:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:56:24,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:24,516 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:24,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1532963173, now seen corresponding path program 1 times [2024-10-24 07:56:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555491062] [2024-10-24 07:56:24,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:56:24,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555491062] [2024-10-24 07:56:24,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555491062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:56:24,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:56:24,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:56:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121474600] [2024-10-24 07:56:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:56:24,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:56:24,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:56:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:56:24,954 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:56:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:25,005 INFO L93 Difference]: Finished difference Result 179 states and 320 transitions. [2024-10-24 07:56:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:56:25,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2024-10-24 07:56:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:25,053 INFO L225 Difference]: With dead ends: 179 [2024-10-24 07:56:25,053 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 07:56:25,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:56:25,065 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:25,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:56:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 07:56:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 07:56:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:56:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2024-10-24 07:56:25,117 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 194 [2024-10-24 07:56:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:25,119 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2024-10-24 07:56:25,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:56:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2024-10-24 07:56:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:56:25,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:25,125 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:25,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:56:25,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:25,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 903056039, now seen corresponding path program 1 times [2024-10-24 07:56:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:25,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783004518] [2024-10-24 07:56:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:56:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:25,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783004518] [2024-10-24 07:56:25,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783004518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:56:25,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:56:25,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:56:25,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586082692] [2024-10-24 07:56:25,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:56:25,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:56:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:56:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:56:25,874 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:26,128 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2024-10-24 07:56:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:56:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 07:56:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:26,131 INFO L225 Difference]: With dead ends: 266 [2024-10-24 07:56:26,131 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 07:56:26,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:56:26,133 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 99 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:26,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 440 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:56:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 07:56:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2024-10-24 07:56:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:56:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 257 transitions. [2024-10-24 07:56:26,156 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 257 transitions. Word has length 194 [2024-10-24 07:56:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:26,157 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 257 transitions. [2024-10-24 07:56:26,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 257 transitions. [2024-10-24 07:56:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:56:26,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:26,160 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:26,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:56:26,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:26,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1161221477, now seen corresponding path program 1 times [2024-10-24 07:56:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:26,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663253590] [2024-10-24 07:56:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:56:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663253590] [2024-10-24 07:56:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663253590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:56:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:56:26,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:56:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587565622] [2024-10-24 07:56:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:56:26,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:56:26,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:56:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:56:26,497 INFO L87 Difference]: Start difference. First operand 162 states and 257 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:26,534 INFO L93 Difference]: Finished difference Result 254 states and 402 transitions. [2024-10-24 07:56:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:56:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 07:56:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:26,537 INFO L225 Difference]: With dead ends: 254 [2024-10-24 07:56:26,537 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 07:56:26,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:56:26,538 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 53 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:26,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 257 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:56:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 07:56:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-24 07:56:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:56:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 256 transitions. [2024-10-24 07:56:26,555 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 256 transitions. Word has length 194 [2024-10-24 07:56:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:26,556 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 256 transitions. [2024-10-24 07:56:26,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 256 transitions. [2024-10-24 07:56:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:56:26,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:26,559 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:26,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:56:26,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 140153123, now seen corresponding path program 1 times [2024-10-24 07:56:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068054206] [2024-10-24 07:56:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:56:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068054206] [2024-10-24 07:56:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068054206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:56:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:56:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:56:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179130783] [2024-10-24 07:56:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:56:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:56:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:27,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:56:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:56:27,082 INFO L87 Difference]: Start difference. First operand 162 states and 256 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:27,263 INFO L93 Difference]: Finished difference Result 354 states and 555 transitions. [2024-10-24 07:56:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:56:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 07:56:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:27,266 INFO L225 Difference]: With dead ends: 354 [2024-10-24 07:56:27,266 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 07:56:27,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:56:27,268 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 134 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:27,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 403 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:56:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 07:56:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 248. [2024-10-24 07:56:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 154 states have internal predecessors, (212), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-24 07:56:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 392 transitions. [2024-10-24 07:56:27,300 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 392 transitions. Word has length 194 [2024-10-24 07:56:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:27,301 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 392 transitions. [2024-10-24 07:56:27,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 392 transitions. [2024-10-24 07:56:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:56:27,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:27,303 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:56:27,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1139710555, now seen corresponding path program 1 times [2024-10-24 07:56:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439208072] [2024-10-24 07:56:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:56:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439208072] [2024-10-24 07:56:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439208072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:56:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117693863] [2024-10-24 07:56:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:27,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:56:27,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:56:27,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:56:27,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:56:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:27,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:56:27,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:56:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-24 07:56:28,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:56:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:56:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117693863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:56:28,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:56:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 07:56:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896548070] [2024-10-24 07:56:28,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:56:28,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:56:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:56:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:56:28,268 INFO L87 Difference]: Start difference. First operand 248 states and 392 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-24 07:56:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:28,464 INFO L93 Difference]: Finished difference Result 459 states and 711 transitions. [2024-10-24 07:56:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:56:28,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 194 [2024-10-24 07:56:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:28,467 INFO L225 Difference]: With dead ends: 459 [2024-10-24 07:56:28,467 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 07:56:28,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:56:28,469 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 58 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:28,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 235 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:56:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 07:56:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2024-10-24 07:56:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 163 states have internal predecessors, (212), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-24 07:56:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2024-10-24 07:56:28,523 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 194 [2024-10-24 07:56:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:28,525 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2024-10-24 07:56:28,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-24 07:56:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2024-10-24 07:56:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 07:56:28,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:28,527 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:28,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:56:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:56:28,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:28,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1285483732, now seen corresponding path program 1 times [2024-10-24 07:56:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937147936] [2024-10-24 07:56:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:56:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937147936] [2024-10-24 07:56:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937147936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:56:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:56:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:56:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737001365] [2024-10-24 07:56:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:56:28,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:56:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:56:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:56:28,899 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:29,065 INFO L93 Difference]: Finished difference Result 649 states and 975 transitions. [2024-10-24 07:56:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:56:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-24 07:56:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:29,069 INFO L225 Difference]: With dead ends: 649 [2024-10-24 07:56:29,069 INFO L226 Difference]: Without dead ends: 450 [2024-10-24 07:56:29,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-10-24 07:56:29,070 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 91 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:29,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 294 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:56:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-24 07:56:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2024-10-24 07:56:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 285 states have (on average 1.287719298245614) internal successors, (367), 285 states have internal predecessors, (367), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-24 07:56:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 667 transitions. [2024-10-24 07:56:29,114 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 667 transitions. Word has length 195 [2024-10-24 07:56:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:29,115 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 667 transitions. [2024-10-24 07:56:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 667 transitions. [2024-10-24 07:56:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:56:29,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:29,116 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:29,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:56:29,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -752805328, now seen corresponding path program 1 times [2024-10-24 07:56:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871717753] [2024-10-24 07:56:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:56:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871717753] [2024-10-24 07:56:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871717753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:56:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801088820] [2024-10-24 07:56:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:29,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:56:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:56:29,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:56:29,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:56:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:29,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:56:29,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:56:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 843 proven. 54 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-10-24 07:56:29,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:56:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:56:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801088820] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:56:29,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:56:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 07:56:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392482931] [2024-10-24 07:56:29,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:56:29,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:56:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:56:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:56:29,874 INFO L87 Difference]: Start difference. First operand 448 states and 667 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-24 07:56:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:30,136 INFO L93 Difference]: Finished difference Result 884 states and 1288 transitions. [2024-10-24 07:56:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:56:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 196 [2024-10-24 07:56:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:30,139 INFO L225 Difference]: With dead ends: 884 [2024-10-24 07:56:30,139 INFO L226 Difference]: Without dead ends: 494 [2024-10-24 07:56:30,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:56:30,142 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 64 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:30,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 205 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:56:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-24 07:56:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 468. [2024-10-24 07:56:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.24) internal successors, (372), 300 states have internal predecessors, (372), 150 states have call successors, (150), 17 states have call predecessors, (150), 17 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-24 07:56:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 672 transitions. [2024-10-24 07:56:30,198 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 672 transitions. Word has length 196 [2024-10-24 07:56:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:30,200 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 672 transitions. [2024-10-24 07:56:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-24 07:56:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 672 transitions. [2024-10-24 07:56:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 07:56:30,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:30,202 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:30,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:56:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 07:56:30,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:30,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1697060045, now seen corresponding path program 1 times [2024-10-24 07:56:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243998028] [2024-10-24 07:56:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:56:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:56:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:56:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:56:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:56:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:56:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:56:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:56:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:56:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:56:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:56:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:56:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:56:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:56:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:56:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:56:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:56:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:56:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:56:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:56:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:56:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:56:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:56:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:56:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:56:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:56:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:56:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:56:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:56:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:56:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:56:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:56:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:56:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243998028] [2024-10-24 07:56:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243998028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:56:30,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:56:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:56:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756510132] [2024-10-24 07:56:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:56:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:56:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:56:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:56:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:56:30,580 INFO L87 Difference]: Start difference. First operand 468 states and 672 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:56:30,704 INFO L93 Difference]: Finished difference Result 878 states and 1261 transitions. [2024-10-24 07:56:30,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:56:30,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-10-24 07:56:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:56:30,708 INFO L225 Difference]: With dead ends: 878 [2024-10-24 07:56:30,708 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 07:56:30,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:56:30,713 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 87 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:56:30,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 343 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:56:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 07:56:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-10-24 07:56:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.23) internal successors, (369), 300 states have internal predecessors, (369), 150 states have call successors, (150), 17 states have call predecessors, (150), 17 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-24 07:56:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 669 transitions. [2024-10-24 07:56:30,767 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 669 transitions. Word has length 198 [2024-10-24 07:56:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:56:30,767 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 669 transitions. [2024-10-24 07:56:30,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:56:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 669 transitions. [2024-10-24 07:56:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-24 07:56:30,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:30,770 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 07:56:30,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:30,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1957190864, now seen corresponding path program 1 times [2024-10-24 07:56:30,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:56:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942945985] [2024-10-24 07:56:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:56:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:56:30,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381801233] [2024-10-24 07:56:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:30,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:56:30,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:56:30,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:56:30,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 07:56:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:56:31,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:56:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:56:31,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:56:31,256 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:56:31,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:56:31,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 07:56:31,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:56:31,462 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:31,587 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:56:31,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:56:31 BoogieIcfgContainer [2024-10-24 07:56:31,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:56:31,592 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:56:31,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:56:31,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:56:31,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:56:24" (3/4) ... [2024-10-24 07:56:31,594 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:56:31,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:56:31,596 INFO L158 Benchmark]: Toolchain (without parser) took 8452.82ms. Allocated memory was 167.8MB in the beginning and 375.4MB in the end (delta: 207.6MB). Free memory was 97.4MB in the beginning and 316.6MB in the end (delta: -219.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:56:31,596 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:56:31,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.54ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 136.4MB in the end (delta: -39.3MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-24 07:56:31,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.13ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 133.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:56:31,597 INFO L158 Benchmark]: Boogie Preprocessor took 75.31ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 128.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:56:31,597 INFO L158 Benchmark]: RCFGBuilder took 654.47ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 98.7MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 07:56:31,597 INFO L158 Benchmark]: TraceAbstraction took 7210.38ms. Allocated memory was 167.8MB in the beginning and 375.4MB in the end (delta: 207.6MB). Free memory was 98.1MB in the beginning and 316.6MB in the end (delta: -218.5MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2024-10-24 07:56:31,597 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 375.4MB. Free memory is still 316.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:56:31,598 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.54ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 136.4MB in the end (delta: -39.3MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.13ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 133.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.31ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 128.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 654.47ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 98.7MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7210.38ms. Allocated memory was 167.8MB in the beginning and 375.4MB in the end (delta: 207.6MB). Free memory was 98.1MB in the beginning and 316.6MB in the end (delta: -218.5MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 375.4MB. Free memory is still 316.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of someUnaryDOUBLEoperation at line 64, overapproximation of bitwiseAnd at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 4.75; [L38] double var_1_22 = 4.6; [L39] unsigned char var_1_23 = 0; [L40] signed long int var_1_28 = 8; [L41] signed long int var_1_30 = 5; [L42] signed long int var_1_31 = 100; [L43] float var_1_34 = 31.8; [L44] unsigned char var_1_35 = 0; [L45] unsigned char var_1_36 = 0; [L46] unsigned long int var_1_37 = 1; [L47] signed long int var_1_38 = 500; [L48] unsigned long int var_1_39 = 2882328056; [L49] unsigned short int var_1_40 = 5; [L50] unsigned short int var_1_41 = 2; [L51] unsigned short int var_1_42 = 50; [L52] unsigned short int var_1_43 = 4; [L53] unsigned char var_1_44 = 0; [L54] signed long int last_1_var_1_1 = 0; [L55] signed long int last_1_var_1_5 = 2; [L56] signed short int last_1_var_1_6 = -10; [L57] unsigned long int last_1_var_1_7 = 1; [L58] float last_1_var_1_14 = 5.4; [L59] signed long int last_1_var_1_17 = 64; [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_5 = var_1_5 [L187] last_1_var_1_6 = var_1_6 [L188] last_1_var_1_7 = var_1_7 [L189] last_1_var_1_14 = var_1_14 [L190] last_1_var_1_17 = var_1_17 [L200] RET updateLastVariables() [L201] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L137] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L140] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L144] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L144] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L146] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L147] var_1_15 = __VERIFIER_nondet_float() [L148] 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_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L148] 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_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L149] var_1_16 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L151] var_1_20 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L153] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L153] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L154] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L154] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L158] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L159] var_1_30 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L161] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L161] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L162] var_1_31 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L163] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L164] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L164] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L165] var_1_36 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L166] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L167] CALL assume_abort_if_not(var_1_36 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L167] RET assume_abort_if_not(var_1_36 <= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L168] var_1_38 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L169] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L170] CALL assume_abort_if_not(var_1_38 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L170] RET assume_abort_if_not(var_1_38 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L171] var_1_39 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L172] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L173] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L173] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L175] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L176] CALL assume_abort_if_not(var_1_41 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L176] RET assume_abort_if_not(var_1_41 <= 32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L178] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L179] CALL assume_abort_if_not(var_1_42 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L179] RET assume_abort_if_not(var_1_42 <= 16384) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L180] var_1_43 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L181] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L182] CALL assume_abort_if_not(var_1_43 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L182] RET assume_abort_if_not(var_1_43 <= 16383) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L201] RET updateVariables() [L202] CALL step() [L63] COND TRUE (32 / var_1_20) > -500 [L64] var_1_19 = ((((var_1_21 - var_1_22) < 0 ) ? -(var_1_21 - var_1_22) : (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L66] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L67] COND TRUE var_1_10 && (1 >= var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L68] COND TRUE \read(var_1_10) [L69] var_1_23 = var_1_10 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L73] EXPR var_1_20 & var_1_6 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L73] COND TRUE (var_1_20 & var_1_6) >= var_1_1 [L74] var_1_28 = (((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) < 0 ) ? -((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) : ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L80] COND TRUE var_1_31 > var_1_7 [L81] var_1_34 = var_1_22 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L83] EXPR var_1_20 & -100 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L83] COND TRUE (var_1_20 & -100) <= var_1_17 [L84] var_1_35 = (! var_1_36) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L86] COND TRUE (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - (var_1_20 + var_1_38)) <= var_1_17 [L87] var_1_37 = ((((var_1_30) > (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31)))))) ? (var_1_30) : (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31))))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L89] var_1_40 = (var_1_41 + (var_1_42 + var_1_43)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L90] COND FALSE !(var_1_7 <= var_1_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L93] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L96] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L98] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L99] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L103] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L104] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L107] signed long int stepLocal_3 = var_1_1; [L108] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=0, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L109] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L114] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=6442450943, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L115] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L122] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=6442450943, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L124] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=6442450943, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L125] COND TRUE var_1_6 < stepLocal_0 [L126] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=6442450943, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L128] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=6442450953, stepLocal_5=6442450943, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L129] COND TRUE (- 8u) >= stepLocal_4 [L130] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=6442450943, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=4, var_1_16=4, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=1, var_1_22=3, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=3, var_1_35=1, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=6442450943] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 2314 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1348 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 772 IncrementalHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 966 mSDtfsCounter, 772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1329 GetRequests, 1295 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 69 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2349 NumberOfCodeBlocks, 2349 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 6574 SizeOfPredicates, 1 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 20475/20880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 07:56:31,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.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 ff10e4ea0b990784e69c3ecfa7bc5bb719f5fb9fd6950865d1eda8efa10d05f0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:56:33,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:56:33,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:56:33,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:56:33,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:56:33,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:56:33,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:56:33,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:56:33,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:56:33,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:56:33,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:56:33,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:56:33,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:56:33,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:56:33,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:56:33,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:56:33,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:56:33,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:56:33,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:56:33,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:56:33,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:56:33,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:56:33,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:56:33,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:56:33,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:56:33,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:56:33,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:56:33,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:56:33,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:56:33,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:56:33,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:56:33,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:56:33,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:56:33,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:56:33,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:56:33,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:56:33,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:56:33,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:56:33,899 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:56:33,899 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:56:33,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:56:33,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:56:33,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:56:33,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:56:33,902 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:56:33,902 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 -> ff10e4ea0b990784e69c3ecfa7bc5bb719f5fb9fd6950865d1eda8efa10d05f0 [2024-10-24 07:56:34,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:56:34,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:56:34,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:56:34,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:56:34,205 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:56:34,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i [2024-10-24 07:56:35,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:56:35,869 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:56:35,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i [2024-10-24 07:56:35,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd84f1eeb/1250d2b43cc9439788e0fcaad9fa0ebc/FLAG50c841f65 [2024-10-24 07:56:35,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd84f1eeb/1250d2b43cc9439788e0fcaad9fa0ebc [2024-10-24 07:56:35,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:56:35,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:56:35,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:56:35,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:56:35,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:56:35,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:56:35" (1/1) ... [2024-10-24 07:56:35,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ed0efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:35, skipping insertion in model container [2024-10-24 07:56:35,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:56:35" (1/1) ... [2024-10-24 07:56:35,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:56:36,091 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i[918,931] [2024-10-24 07:56:36,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:56:36,176 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:56:36,189 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i[918,931] [2024-10-24 07:56:36,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:56:36,258 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:56:36,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36 WrapperNode [2024-10-24 07:56:36,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:56:36,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:56:36,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:56:36,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:56:36,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,311 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-24 07:56:36,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:56:36,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:56:36,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:56:36,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:56:36,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,352 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:56:36,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:56:36,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:56:36,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:56:36,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:56:36,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (1/1) ... [2024-10-24 07:56:36,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:56:36,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:56:36,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:56:36,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:56:36,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:56:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:56:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:56:36,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:56:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:56:36,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:56:36,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:56:36,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:56:58,835 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:56:58,835 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:56:58,881 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:56:58,881 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:56:58,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:56:58 BoogieIcfgContainer [2024-10-24 07:56:58,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:56:58,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:56:58,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:56:58,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:56:58,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:56:35" (1/3) ... [2024-10-24 07:56:58,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f3dbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:56:58, skipping insertion in model container [2024-10-24 07:56:58,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:56:36" (2/3) ... [2024-10-24 07:56:58,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f3dbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:56:58, skipping insertion in model container [2024-10-24 07:56:58,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:56:58" (3/3) ... [2024-10-24 07:56:58,888 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-0.i [2024-10-24 07:56:58,900 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:56:58,900 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:56:58,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:56:58,970 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;@5be5d57d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:56:58,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:56:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:56:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:56:58,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:56:58,987 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:56:58,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:56:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:56:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1881937042, now seen corresponding path program 1 times [2024-10-24 07:56:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:56:59,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346129550] [2024-10-24 07:56:59,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:56:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:56:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:56:59,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:56:59,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 07:57:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:57:00,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:57:00,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:57:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-24 07:57:10,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:57:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:57:18,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:57:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346129550] [2024-10-24 07:57:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346129550] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:57:18,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:57:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 07:57:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710573446] [2024-10-24 07:57:18,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:57:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:57:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:57:18,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:57:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:57:18,028 INFO L87 Difference]: Start difference. First operand has 85 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-24 07:57:30,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:57:34,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:57:38,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:57:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:57:39,236 INFO L93 Difference]: Finished difference Result 179 states and 320 transitions. [2024-10-24 07:57:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:57:39,239 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, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 192 [2024-10-24 07:57:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:57:39,245 INFO L225 Difference]: With dead ends: 179 [2024-10-24 07:57:39,245 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 07:57:39,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:57:39,250 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 138 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:57:39,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 203 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 3 Unknown, 0 Unchecked, 20.3s Time] [2024-10-24 07:57:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 07:57:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2024-10-24 07:57:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:57:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 135 transitions. [2024-10-24 07:57:39,287 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 135 transitions. Word has length 192 [2024-10-24 07:57:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:57:39,288 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 135 transitions. [2024-10-24 07:57:39,288 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, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-24 07:57:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 135 transitions. [2024-10-24 07:57:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 07:57:39,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:57:39,292 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:57:39,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 07:57:39,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:57:39,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:57:39,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:57:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -688826543, now seen corresponding path program 1 times [2024-10-24 07:57:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:57:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064480058] [2024-10-24 07:57:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:57:39,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:57:39,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:57:39,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:57:39,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 07:57:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:57:41,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 07:57:41,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:58:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-24 07:58:01,545 INFO L311 TraceCheckSpWp]: Computing backward predicates...