./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.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 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:56:50,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:56:51,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:56:51,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:56:51,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:56:51,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:56:51,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:56:51,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:56:51,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:56:51,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:56:51,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:56:51,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:56:51,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:56:51,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:56:51,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:56:51,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:56:51,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:56:51,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:56:51,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:56:51,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:56:51,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:56:51,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:56:51,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:56:51,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:56:51,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:56:51,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:56:51,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:56:51,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:56:51,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:56:51,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:56:51,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:56:51,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:56:51,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:56:51,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:56:51,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:56:51,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:56:51,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:56:51,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:56:51,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:56:51,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:56:51,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:56:51,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:56:51,069 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 -> 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f [2024-11-12 03:56:51,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:56:51,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:56:51,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:56:51,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:56:51,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:56:51,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2024-11-12 03:56:52,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:56:52,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:56:52,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2024-11-12 03:56:52,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e828238ed/14e070cac88e4afea8214fe2f4a06c4e/FLAG67abae4e2 [2024-11-12 03:56:53,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e828238ed/14e070cac88e4afea8214fe2f4a06c4e [2024-11-12 03:56:53,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:56:53,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:56:53,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:56:53,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:56:53,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:56:53,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5679af5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53, skipping insertion in model container [2024-11-12 03:56:53,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:56:53,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i[919,932] [2024-11-12 03:56:53,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:56:53,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:56:53,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i[919,932] [2024-11-12 03:56:53,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:56:53,586 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:56:53,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53 WrapperNode [2024-11-12 03:56:53,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:56:53,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:56:53,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:56:53,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:56:53,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,644 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-12 03:56:53,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:56:53,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:56:53,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:56:53,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:56:53,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,674 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:56:53,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:56:53,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:56:53,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:56:53,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:56:53,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (1/1) ... [2024-11-12 03:56:53,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:56:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:56:53,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:56:53,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:56:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:56:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:56:53,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:56:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:56:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:56:53,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:56:53,854 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:56:53,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:56:54,176 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 03:56:54,176 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:56:54,189 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:56:54,189 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:56:54,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:56:54 BoogieIcfgContainer [2024-11-12 03:56:54,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:56:54,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:56:54,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:56:54,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:56:54,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:56:53" (1/3) ... [2024-11-12 03:56:54,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2827b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:56:54, skipping insertion in model container [2024-11-12 03:56:54,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:56:53" (2/3) ... [2024-11-12 03:56:54,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2827b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:56:54, skipping insertion in model container [2024-11-12 03:56:54,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:56:54" (3/3) ... [2024-11-12 03:56:54,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2024-11-12 03:56:54,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:56:54,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:56:54,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:56:54,263 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;@7e609ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:56:54,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:56:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:56:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:56:54,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:54,280 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:54,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:54,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1569411451, now seen corresponding path program 1 times [2024-11-12 03:56:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:54,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94292125] [2024-11-12 03:56:54,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:56:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:56:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:56:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:56:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:56:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:56:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:56:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:56:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:56:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:56:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:56:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:56:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:56:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:56:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:56:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:56:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:56:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:56:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:56:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:56:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:56:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:56:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:56:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:56:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:56:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:56:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94292125] [2024-11-12 03:56:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94292125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:56:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:56:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:56:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685487763] [2024-11-12 03:56:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:56:54,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:56:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:56:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:56:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:56:54,715 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:56:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:54,748 INFO L93 Difference]: Finished difference Result 197 states and 340 transitions. [2024-11-12 03:56:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:56:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-12 03:56:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:54,757 INFO L225 Difference]: With dead ends: 197 [2024-11-12 03:56:54,757 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 03:56:54,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:56:54,766 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:54,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:56:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 03:56:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 03:56:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:56:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-12 03:56:54,818 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 165 [2024-11-12 03:56:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-12 03:56:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:56:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-12 03:56:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:56:54,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:54,825 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:54,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:56:54,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:54,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 903094583, now seen corresponding path program 1 times [2024-11-12 03:56:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533964253] [2024-11-12 03:56:54,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:56:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:56:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:56:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:56:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:56:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:56:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:56:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:56:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:56:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:56:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:56:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:56:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:56:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:56:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:56:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:56:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:56:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:56:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:56:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:56:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:56:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:56:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:56:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:56:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:56:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:56:55,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533964253] [2024-11-12 03:56:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533964253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:56:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:56:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:56:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361791193] [2024-11-12 03:56:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:56:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:56:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:56:55,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:56:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:56:55,179 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:55,209 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-11-12 03:56:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:56:55,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-12 03:56:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:55,212 INFO L225 Difference]: With dead ends: 193 [2024-11-12 03:56:55,212 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 03:56:55,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:56:55,217 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:55,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:56:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 03:56:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 03:56:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:56:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-11-12 03:56:55,230 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 165 [2024-11-12 03:56:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:55,232 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-11-12 03:56:55,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-11-12 03:56:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:56:55,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:55,235 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:55,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:56:55,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:55,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -785849159, now seen corresponding path program 1 times [2024-11-12 03:56:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:55,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653633461] [2024-11-12 03:56:55,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:55,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:56:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:56:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:56:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:56:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:56:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:56:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:56:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:56:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:56:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:56:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:56:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:56:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:56:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:56:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:56:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:56:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:56:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:56:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:56:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:56:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:56:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:56:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:56:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:56:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:56:55,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:56:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653633461] [2024-11-12 03:56:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653633461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:56:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:56:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:56:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260545306] [2024-11-12 03:56:55,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:56:55,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:56:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:56:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:56:55,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:55,655 INFO L87 Difference]: Start difference. First operand 98 states and 151 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:55,841 INFO L93 Difference]: Finished difference Result 287 states and 445 transitions. [2024-11-12 03:56:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:56:55,842 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-12 03:56:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:55,847 INFO L225 Difference]: With dead ends: 287 [2024-11-12 03:56:55,847 INFO L226 Difference]: Without dead ends: 192 [2024-11-12 03:56:55,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:56:55,850 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 136 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:55,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 383 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:56:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-12 03:56:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 117. [2024-11-12 03:56:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 91 states have internal predecessors, (133), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:56:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 181 transitions. [2024-11-12 03:56:55,871 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 181 transitions. Word has length 165 [2024-11-12 03:56:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:55,871 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 181 transitions. [2024-11-12 03:56:55,872 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 181 transitions. [2024-11-12 03:56:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:56:55,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:55,877 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:55,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:56:55,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:55,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash 802498743, now seen corresponding path program 1 times [2024-11-12 03:56:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630468327] [2024-11-12 03:56:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:56:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:56:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:56:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:56:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:56:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:56:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:56:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:56:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:56:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:56:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:56:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:56:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:56:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:56:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:56:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:56:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:56:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:56:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:56:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:56:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:56:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:56:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:56:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:56:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:56:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:56:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630468327] [2024-11-12 03:56:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630468327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:56:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:56:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:56:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314948111] [2024-11-12 03:56:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:56:56,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:56:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:56:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:56:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:56,120 INFO L87 Difference]: Start difference. First operand 117 states and 181 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:56:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:56,196 INFO L93 Difference]: Finished difference Result 345 states and 537 transitions. [2024-11-12 03:56:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:56:56,197 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), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-12 03:56:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:56,199 INFO L225 Difference]: With dead ends: 345 [2024-11-12 03:56:56,199 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 03:56:56,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:56,200 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 119 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:56,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 427 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:56:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 03:56:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2024-11-12 03:56:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 178 states have internal predecessors, (261), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:56:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2024-11-12 03:56:56,225 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 165 [2024-11-12 03:56:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:56,226 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2024-11-12 03:56:56,226 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), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:56:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2024-11-12 03:56:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:56:56,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:56,228 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:56:56,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1021353461, now seen corresponding path program 1 times [2024-11-12 03:56:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257308493] [2024-11-12 03:56:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:56:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:56:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:56:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:56:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:56:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:56:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:56:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:56:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:56:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:56:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:56:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:56:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:56:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:56:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:56:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:56:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:56:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:56:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:56:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:56:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:56:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:56:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:56:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:56:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:56:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:56:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257308493] [2024-11-12 03:56:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257308493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:56:56,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:56:56,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:56:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840963062] [2024-11-12 03:56:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:56:56,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:56:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:56:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:56:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:56,562 INFO L87 Difference]: Start difference. First operand 229 states and 357 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:56,657 INFO L93 Difference]: Finished difference Result 231 states and 358 transitions. [2024-11-12 03:56:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:56:56,658 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-12 03:56:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:56,661 INFO L225 Difference]: With dead ends: 231 [2024-11-12 03:56:56,661 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 03:56:56,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:56,662 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 95 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:56,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:56:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 03:56:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-12 03:56:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:56:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 178 transitions. [2024-11-12 03:56:56,676 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 178 transitions. Word has length 165 [2024-11-12 03:56:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 178 transitions. [2024-11-12 03:56:56,679 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 178 transitions. [2024-11-12 03:56:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:56:56,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:56,680 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:56:56,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash -258510217, now seen corresponding path program 1 times [2024-11-12 03:56:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103525727] [2024-11-12 03:56:56,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:56:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:56:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:56:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:56:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:56:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:56:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:56:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:56:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:56:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:56:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:56:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:56:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:56:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:56:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:56:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:56:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:56:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:56:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:56:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:56:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:56:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:56:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:56:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:56:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:56:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:56:56,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103525727] [2024-11-12 03:56:56,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103525727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:56:56,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:56:56,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:56:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111061783] [2024-11-12 03:56:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:56:56,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:56:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:56:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:56:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:56,986 INFO L87 Difference]: Start difference. First operand 117 states and 178 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:57,152 INFO L93 Difference]: Finished difference Result 306 states and 467 transitions. [2024-11-12 03:56:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:56:57,153 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-12 03:56:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:57,155 INFO L225 Difference]: With dead ends: 306 [2024-11-12 03:56:57,155 INFO L226 Difference]: Without dead ends: 192 [2024-11-12 03:56:57,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:56:57,156 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 232 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:57,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 337 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:56:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-12 03:56:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 122. [2024-11-12 03:56:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:56:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 183 transitions. [2024-11-12 03:56:57,174 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 183 transitions. Word has length 165 [2024-11-12 03:56:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:57,175 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 183 transitions. [2024-11-12 03:56:57,175 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:56:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 183 transitions. [2024-11-12 03:56:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:56:57,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:57,176 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:56:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 03:56:57,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1296974503, now seen corresponding path program 1 times [2024-11-12 03:56:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497012179] [2024-11-12 03:56:57,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:56:57,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298532145] [2024-11-12 03:56:57,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:57,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:56:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:56:57,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:56:57,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 03:56:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:57,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 03:56:57,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:56:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-12 03:56:58,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:57:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:57:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:57:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497012179] [2024-11-12 03:57:06,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:57:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298532145] [2024-11-12 03:57:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298532145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:57:06,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:57:06,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2024-11-12 03:57:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184172751] [2024-11-12 03:57:06,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:57:06,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 03:57:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:57:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 03:57:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=160, Unknown=2, NotChecked=0, Total=210 [2024-11-12 03:57:06,729 INFO L87 Difference]: Start difference. First operand 122 states and 183 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-12 03:57:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:57:08,376 INFO L93 Difference]: Finished difference Result 580 states and 844 transitions. [2024-11-12 03:57:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-12 03:57:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 167 [2024-11-12 03:57:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:57:08,384 INFO L225 Difference]: With dead ends: 580 [2024-11-12 03:57:08,384 INFO L226 Difference]: Without dead ends: 461 [2024-11-12 03:57:08,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=589, Invalid=1571, Unknown=2, NotChecked=0, Total=2162 [2024-11-12 03:57:08,386 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 637 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:57:08,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 900 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:57:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-12 03:57:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 320. [2024-11-12 03:57:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 263 states have (on average 1.349809885931559) internal successors, (355), 265 states have internal predecessors, (355), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 03:57:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2024-11-12 03:57:08,446 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 167 [2024-11-12 03:57:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:57:08,446 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2024-11-12 03:57:08,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-12 03:57:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2024-11-12 03:57:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:57:08,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:08,450 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:08,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:57:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:57:08,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:08,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash 657503306, now seen corresponding path program 1 times [2024-11-12 03:57:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:57:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017739103] [2024-11-12 03:57:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:57:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:57:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368884604] [2024-11-12 03:57:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:57:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:57:08,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:57:08,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 03:57:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:08,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 03:57:08,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:57:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-12 03:57:09,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:57:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:57:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017739103] [2024-11-12 03:57:14,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:57:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368884604] [2024-11-12 03:57:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368884604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:57:14,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:57:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-12 03:57:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999312503] [2024-11-12 03:57:14,006 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 03:57:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:57:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:57:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:57:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2024-11-12 03:57:14,007 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:57:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:57:14,787 INFO L93 Difference]: Finished difference Result 662 states and 939 transitions. [2024-11-12 03:57:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 03:57:14,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 168 [2024-11-12 03:57:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:57:14,790 INFO L225 Difference]: With dead ends: 662 [2024-11-12 03:57:14,790 INFO L226 Difference]: Without dead ends: 345 [2024-11-12 03:57:14,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=231, Invalid=580, Unknown=1, NotChecked=0, Total=812 [2024-11-12 03:57:14,791 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 274 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:57:14,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 557 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:57:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-12 03:57:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 301. [2024-11-12 03:57:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3401639344262295) internal successors, (327), 246 states have internal predecessors, (327), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 03:57:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 427 transitions. [2024-11-12 03:57:14,815 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 427 transitions. Word has length 168 [2024-11-12 03:57:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:57:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 427 transitions. [2024-11-12 03:57:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:57:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 427 transitions. [2024-11-12 03:57:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:57:14,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:14,817 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:14,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 03:57:15,017 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,SelfDestructingSolverStorable7 [2024-11-12 03:57:15,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1721802265, now seen corresponding path program 1 times [2024-11-12 03:57:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:57:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063737492] [2024-11-12 03:57:15,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:57:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:57:15,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389642951] [2024-11-12 03:57:15,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:57:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:57:15,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:57:15,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:57:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:15,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 03:57:15,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:57:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-12 03:57:16,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:57:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:57:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063737492] [2024-11-12 03:57:17,443 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:57:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389642951] [2024-11-12 03:57:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389642951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:57:17,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:57:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-12 03:57:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374787267] [2024-11-12 03:57:17,443 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 03:57:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:57:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:57:17,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:57:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=81, Unknown=5, NotChecked=0, Total=110 [2024-11-12 03:57:17,445 INFO L87 Difference]: Start difference. First operand 301 states and 427 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:57:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:57:18,450 INFO L93 Difference]: Finished difference Result 629 states and 871 transitions. [2024-11-12 03:57:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 03:57:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 168 [2024-11-12 03:57:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:57:18,453 INFO L225 Difference]: With dead ends: 629 [2024-11-12 03:57:18,453 INFO L226 Difference]: Without dead ends: 331 [2024-11-12 03:57:18,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=272, Unknown=5, NotChecked=0, Total=380 [2024-11-12 03:57:18,454 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 202 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 101 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:57:18,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 394 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 181 Invalid, 62 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:57:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-12 03:57:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 289. [2024-11-12 03:57:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 239 states have (on average 1.297071129707113) internal successors, (310), 241 states have internal predecessors, (310), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 03:57:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 392 transitions. [2024-11-12 03:57:18,482 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 392 transitions. Word has length 168 [2024-11-12 03:57:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:57:18,482 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 392 transitions. [2024-11-12 03:57:18,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:57:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 392 transitions. [2024-11-12 03:57:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:57:18,483 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:18,483 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:18,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 03:57:18,684 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-11-12 03:57:18,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:18,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 573676825, now seen corresponding path program 1 times [2024-11-12 03:57:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:57:18,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827882214] [2024-11-12 03:57:18,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:57:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:57:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024653176] [2024-11-12 03:57:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:57:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:57:18,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:57:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 03:57:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:57:18,941 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:57:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:57:19,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:57:19,071 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:57:19,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:57:19,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 03:57:19,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:57:19,277 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:19,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:57:19,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:57:19 BoogieIcfgContainer [2024-11-12 03:57:19,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:57:19,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:57:19,388 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:57:19,388 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:57:19,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:56:54" (3/4) ... [2024-11-12 03:57:19,391 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:57:19,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:57:19,393 INFO L158 Benchmark]: Toolchain (without parser) took 26138.98ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 113.9MB in the beginning and 106.5MB in the end (delta: 7.4MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. [2024-11-12 03:57:19,393 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:57:19,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.23ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:57:19,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.86ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:57:19,393 INFO L158 Benchmark]: Boogie Preprocessor took 48.36ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 89.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:57:19,394 INFO L158 Benchmark]: RCFGBuilder took 495.98ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 63.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 03:57:19,394 INFO L158 Benchmark]: TraceAbstraction took 25196.31ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 62.6MB in the beginning and 106.5MB in the end (delta: -44.0MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-11-12 03:57:19,395 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 251.7MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:57:19,396 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.15ms. Allocated memory is still 142.6MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.23ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.86ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.36ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 89.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 495.98ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 63.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25196.31ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 62.6MB in the beginning and 106.5MB in the end (delta: -44.0MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 251.7MB. Free memory is still 106.5MB. 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 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someUnaryFLOAToperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(var_1_5 != var_1_21) [L63] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND TRUE \read(var_1_17) [L66] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L73] COND TRUE var_1_16 < ((var_1_6 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L74] COND FALSE !(var_1_17 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L82] COND TRUE (var_1_35 <= 64.5) && var_1_18 [L83] var_1_40 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L87] COND FALSE !(var_1_20 < var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L90] COND TRUE \read(var_1_17) [L91] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L93] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L94] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L97] var_1_21 = var_1_6 [L98] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L99] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L102] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L103] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L106] signed long int stepLocal_3 = var_1_9; [L107] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=50, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L108] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=50, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L108] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L109] COND FALSE !(var_1_9 <= stepLocal_2) [L118] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L120] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L127] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L129] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=1, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L130] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=0, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L131] COND TRUE \read(var_1_13) [L132] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=1, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=1, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=1, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=1, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=1, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=-255, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=-255, var_1_18=-255, var_1_19=1, var_1_1=17/2, var_1_20=8, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 62 mSolverCounterUnknown, 1713 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1695 mSDsluCounter, 3678 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2224 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2075 IncrementalHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 1454 mSDtfsCounter, 2075 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1130 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=7, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 374 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1650 ConstructedInterpolants, 1 QuantifiedInterpolants, 6227 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1159 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10905/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 03:57:19,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.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 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:57:21,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:57:21,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:57:21,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:57:21,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:57:21,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:57:21,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:57:21,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:57:21,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:57:21,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:57:21,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:57:21,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:57:21,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:57:21,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:57:21,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:57:21,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:57:21,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:57:21,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:57:21,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:57:21,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:57:21,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:57:21,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:57:21,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:57:21,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:57:21,556 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:57:21,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:57:21,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:57:21,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:57:21,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:57:21,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:57:21,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:57:21,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:57:21,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:57:21,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:57:21,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:57:21,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:57:21,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:57:21,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:57:21,558 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:57:21,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:57:21,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:57:21,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:57:21,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:57:21,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:57:21,560 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 -> 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f [2024-11-12 03:57:21,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:57:21,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:57:21,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:57:21,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:57:21,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:57:21,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2024-11-12 03:57:23,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:57:23,599 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:57:23,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2024-11-12 03:57:23,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21918b0d/d150139bdb4f464a8427a8999c67f8d6/FLAG155074cc9 [2024-11-12 03:57:23,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21918b0d/d150139bdb4f464a8427a8999c67f8d6 [2024-11-12 03:57:23,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:57:23,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:57:23,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:57:23,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:57:23,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:57:23,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:23,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d1bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23, skipping insertion in model container [2024-11-12 03:57:23,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:23,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:57:23,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i[919,932] [2024-11-12 03:57:23,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:57:23,928 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:57:23,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i[919,932] [2024-11-12 03:57:23,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:57:23,995 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:57:23,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23 WrapperNode [2024-11-12 03:57:23,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:57:23,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:57:23,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:57:23,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:57:24,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,044 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 03:57:24,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:57:24,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:57:24,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:57:24,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:57:24,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:57:24,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:57:24,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:57:24,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:57:24,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:57:24,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (1/1) ... [2024-11-12 03:57:24,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:57:24,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:57:24,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:57:24,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:57:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:57:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:57:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:57:24,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:57:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:57:24,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:57:24,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:57:24,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:57:25,003 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 03:57:25,003 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:57:25,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:57:25,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:57:25,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:57:25 BoogieIcfgContainer [2024-11-12 03:57:25,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:57:25,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:57:25,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:57:25,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:57:25,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:57:23" (1/3) ... [2024-11-12 03:57:25,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb63d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:57:25, skipping insertion in model container [2024-11-12 03:57:25,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:57:23" (2/3) ... [2024-11-12 03:57:25,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb63d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:57:25, skipping insertion in model container [2024-11-12 03:57:25,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:57:25" (3/3) ... [2024-11-12 03:57:25,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2024-11-12 03:57:25,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:57:25,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:57:25,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:57:25,125 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;@3073d47d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:57:25,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:57:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:57:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:57:25,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:25,145 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:25,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:25,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2101057650, now seen corresponding path program 1 times [2024-11-12 03:57:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:57:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099677552] [2024-11-12 03:57:25,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:25,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:57:25,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:57:25,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 03:57:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:25,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:57:25,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:57:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-12 03:57:25,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:57:25,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:57:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099677552] [2024-11-12 03:57:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099677552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:57:25,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:57:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:57:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706907619] [2024-11-12 03:57:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:57:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:57:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:57:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:57:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:57:25,611 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:57:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:57:25,638 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-11-12 03:57:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:57:25,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-12 03:57:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:57:25,645 INFO L225 Difference]: With dead ends: 161 [2024-11-12 03:57:25,646 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 03:57:25,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:57:25,651 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:57:25,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:57:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 03:57:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 03:57:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:57:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2024-11-12 03:57:25,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 161 [2024-11-12 03:57:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:57:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2024-11-12 03:57:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:57:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2024-11-12 03:57:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:57:25,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:25,696 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:25,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:57:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:25,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:25,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1467845302, now seen corresponding path program 1 times [2024-11-12 03:57:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:57:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739061757] [2024-11-12 03:57:25,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:25,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:25,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:57:25,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:57:25,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 03:57:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:26,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:57:26,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:57:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:57:26,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:57:26,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:57:26,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739061757] [2024-11-12 03:57:26,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739061757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:57:26,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:57:26,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:57:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108386353] [2024-11-12 03:57:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:57:26,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:57:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:57:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:57:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:57:26,656 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:57:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:57:26,912 INFO L93 Difference]: Finished difference Result 234 states and 372 transitions. [2024-11-12 03:57:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:57:26,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 03:57:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:57:26,917 INFO L225 Difference]: With dead ends: 234 [2024-11-12 03:57:26,919 INFO L226 Difference]: Without dead ends: 157 [2024-11-12 03:57:26,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:57:26,921 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 50 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:57:26,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:57:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-12 03:57:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-12 03:57:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:57:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2024-11-12 03:57:26,958 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 161 [2024-11-12 03:57:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:57:26,958 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2024-11-12 03:57:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:57:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2024-11-12 03:57:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:57:26,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:26,960 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:26,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 03:57:27,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:27,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:27,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash 832977288, now seen corresponding path program 1 times [2024-11-12 03:57:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:57:27,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093722860] [2024-11-12 03:57:27,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:57:27,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:57:27,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 03:57:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 03:57:27,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:57:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:57:27,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:57:27,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:57:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093722860] [2024-11-12 03:57:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093722860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:57:27,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:57:27,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:57:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228724017] [2024-11-12 03:57:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:57:27,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:57:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:57:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:57:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:57:27,829 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:57:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:57:28,347 INFO L93 Difference]: Finished difference Result 326 states and 517 transitions. [2024-11-12 03:57:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:57:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 03:57:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:57:28,361 INFO L225 Difference]: With dead ends: 326 [2024-11-12 03:57:28,361 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 03:57:28,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:57:28,363 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 145 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:57:28,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 394 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:57:28,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 03:57:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2024-11-12 03:57:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 104 states have internal predecessors, (150), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:57:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 246 transitions. [2024-11-12 03:57:28,385 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 246 transitions. Word has length 161 [2024-11-12 03:57:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:57:28,386 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 246 transitions. [2024-11-12 03:57:28,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:57:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 246 transitions. [2024-11-12 03:57:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:57:28,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:57:28,388 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:57:28,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 03:57:28,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:28,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:57:28,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:57:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash -446886390, now seen corresponding path program 1 times [2024-11-12 03:57:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:57:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986579868] [2024-11-12 03:57:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:28,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:57:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:57:28,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:57:28,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 03:57:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:28,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 03:57:28,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:57:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-12 03:57:30,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:57:30,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:57:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986579868] [2024-11-12 03:57:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986579868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:57:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1402978610] [2024-11-12 03:57:30,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:57:30,734 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:57:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:57:30,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:57:30,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 03:57:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:57:31,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 03:57:31,678 INFO L279 TraceCheckSpWp]: Computing forward predicates...