./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.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 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:05:51,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:05:51,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:05:51,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:05:51,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:05:51,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:05:51,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:05:51,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:05:51,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:05:51,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:05:51,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:05:51,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:05:51,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:05:51,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:05:51,828 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:05:51,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:05:51,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:05:51,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:05:51,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:05:51,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:05:51,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:05:51,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:05:51,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:05:51,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:05:51,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:05:51,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:05:51,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:05:51,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:05:51,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:05:51,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:05:51,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:05:51,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:05:51,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:05:51,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:05:51,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:05:51,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:05:51,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:05:51,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:05:51,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:05:51,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:05:51,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:05:51,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:05:51,840 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 -> 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc [2024-11-08 21:05:52,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:05:52,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:05:52,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:05:52,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:05:52,110 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:05:52,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-11-08 21:05:53,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:05:53,755 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:05:53,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-11-08 21:05:53,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934a81828/17a4f1a18a2b4fd7bd2befc30634e3a6/FLAGbdbbe3e06 [2024-11-08 21:05:53,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934a81828/17a4f1a18a2b4fd7bd2befc30634e3a6 [2024-11-08 21:05:53,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:05:53,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:05:53,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:05:53,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:05:53,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:05:53,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:05:53" (1/1) ... [2024-11-08 21:05:53,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761362e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:53, skipping insertion in model container [2024-11-08 21:05:53,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:05:53" (1/1) ... [2024-11-08 21:05:53,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:05:53,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-11-08 21:05:54,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:05:54,069 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:05:54,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-11-08 21:05:54,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:05:54,160 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:05:54,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54 WrapperNode [2024-11-08 21:05:54,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:05:54,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:05:54,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:05:54,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:05:54,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,223 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-08 21:05:54,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:05:54,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:05:54,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:05:54,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:05:54,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,257 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-08 21:05:54,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:05:54,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:05:54,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:05:54,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:05:54,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (1/1) ... [2024-11-08 21:05:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:05:54,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:05:54,336 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-08 21:05:54,338 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-08 21:05:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:05:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:05:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:05:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:05:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:05:54,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:05:54,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:05:54,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:05:54,915 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:05:54,915 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:05:54,930 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:05:54,930 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:05:54,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:05:54 BoogieIcfgContainer [2024-11-08 21:05:54,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:05:54,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:05:54,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:05:54,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:05:54,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:05:53" (1/3) ... [2024-11-08 21:05:54,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9c8151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:05:54, skipping insertion in model container [2024-11-08 21:05:54,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:54" (2/3) ... [2024-11-08 21:05:54,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9c8151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:05:54, skipping insertion in model container [2024-11-08 21:05:54,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:05:54" (3/3) ... [2024-11-08 21:05:54,940 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-11-08 21:05:54,954 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:05:54,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:05:55,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:05:55,012 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;@c655256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:05:55,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:05:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 62 states have (on average 1.467741935483871) internal successors, (91), 63 states have internal predecessors, (91), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:05:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:05:55,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:55,034 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:55,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:55,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash -809528128, now seen corresponding path program 1 times [2024-11-08 21:05:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497213335] [2024-11-08 21:05:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:55,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497213335] [2024-11-08 21:05:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497213335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:05:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836272822] [2024-11-08 21:05:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:55,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:05:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:05:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:05:55,680 INFO L87 Difference]: Start difference. First operand has 96 states, 62 states have (on average 1.467741935483871) internal successors, (91), 63 states have internal predecessors, (91), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 21:05:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:55,726 INFO L93 Difference]: Finished difference Result 185 states and 331 transitions. [2024-11-08 21:05:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:05:55,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2024-11-08 21:05:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:55,740 INFO L225 Difference]: With dead ends: 185 [2024-11-08 21:05:55,741 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 21:05:55,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-08 21:05:55,753 INFO L432 NwaCegarLoop]: 145 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, 145 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-08 21:05:55,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:05:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 21:05:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 21:05:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:05:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2024-11-08 21:05:55,807 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 199 [2024-11-08 21:05:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:55,808 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2024-11-08 21:05:55,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 21:05:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2024-11-08 21:05:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:05:55,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:55,813 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:55,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:05:55,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:55,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1548372158, now seen corresponding path program 1 times [2024-11-08 21:05:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:55,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399479044] [2024-11-08 21:05:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:56,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399479044] [2024-11-08 21:05:56,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399479044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:56,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:05:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208071805] [2024-11-08 21:05:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:56,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:05:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:05:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:56,252 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:56,479 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2024-11-08 21:05:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:05:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-08 21:05:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:56,499 INFO L225 Difference]: With dead ends: 227 [2024-11-08 21:05:56,499 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 21:05:56,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:56,501 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:56,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 361 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:05:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 21:05:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2024-11-08 21:05:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 21:05:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 212 transitions. [2024-11-08 21:05:56,553 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 212 transitions. Word has length 199 [2024-11-08 21:05:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:56,554 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 212 transitions. [2024-11-08 21:05:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 212 transitions. [2024-11-08 21:05:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:05:56,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:56,565 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:56,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:05:56,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:56,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1806537596, now seen corresponding path program 1 times [2024-11-08 21:05:56,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:56,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218237545] [2024-11-08 21:05:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:56,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:56,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218237545] [2024-11-08 21:05:56,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218237545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:56,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:56,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:05:56,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259266570] [2024-11-08 21:05:56,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:56,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:05:56,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:05:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:57,001 INFO L87 Difference]: Start difference. First operand 135 states and 212 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:57,168 INFO L93 Difference]: Finished difference Result 299 states and 465 transitions. [2024-11-08 21:05:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:05:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-08 21:05:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:57,175 INFO L225 Difference]: With dead ends: 299 [2024-11-08 21:05:57,175 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 21:05:57,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-08 21:05:57,177 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 85 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:57,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 256 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 21:05:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 99. [2024-11-08 21:05:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:05:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2024-11-08 21:05:57,194 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 199 [2024-11-08 21:05:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:57,195 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2024-11-08 21:05:57,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2024-11-08 21:05:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 21:05:57,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:57,201 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:57,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:05:57,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1359897096, now seen corresponding path program 1 times [2024-11-08 21:05:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850816932] [2024-11-08 21:05:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:57,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:57,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850816932] [2024-11-08 21:05:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850816932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:05:57,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071991931] [2024-11-08 21:05:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:57,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:05:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:05:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:05:57,382 INFO L87 Difference]: Start difference. First operand 99 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:57,432 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-08 21:05:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:05:57,433 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-08 21:05:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:57,435 INFO L225 Difference]: With dead ends: 195 [2024-11-08 21:05:57,435 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 21:05:57,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-08 21:05:57,440 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:57,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:05:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 21:05:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-08 21:05:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:05:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2024-11-08 21:05:57,460 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 200 [2024-11-08 21:05:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2024-11-08 21:05:57,461 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2024-11-08 21:05:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 21:05:57,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:57,465 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:05:57,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:57,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1395344971, now seen corresponding path program 1 times [2024-11-08 21:05:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466941629] [2024-11-08 21:05:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:57,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:57,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466941629] [2024-11-08 21:05:57,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466941629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:05:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606068596] [2024-11-08 21:05:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:05:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:05:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:05:57,953 INFO L87 Difference]: Start difference. First operand 98 states and 150 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:58,002 INFO L93 Difference]: Finished difference Result 288 states and 444 transitions. [2024-11-08 21:05:58,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:05:58,006 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-08 21:05:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:58,009 INFO L225 Difference]: With dead ends: 288 [2024-11-08 21:05:58,009 INFO L226 Difference]: Without dead ends: 193 [2024-11-08 21:05:58,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-08 21:05:58,010 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 80 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:58,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 307 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:05:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-08 21:05:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-08 21:05:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 124 states have internal predecessors, (171), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:05:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 295 transitions. [2024-11-08 21:05:58,045 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 295 transitions. Word has length 200 [2024-11-08 21:05:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:58,047 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 295 transitions. [2024-11-08 21:05:58,047 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 295 transitions. [2024-11-08 21:05:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:05:58,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:58,050 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:05:58,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -360766453, now seen corresponding path program 1 times [2024-11-08 21:05:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431667694] [2024-11-08 21:05:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:58,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431667694] [2024-11-08 21:05:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431667694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:05:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648885327] [2024-11-08 21:05:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:58,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:05:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:05:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:05:58,301 INFO L87 Difference]: Start difference. First operand 191 states and 295 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:58,754 INFO L93 Difference]: Finished difference Result 558 states and 866 transitions. [2024-11-08 21:05:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:05:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-08 21:05:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:58,760 INFO L225 Difference]: With dead ends: 558 [2024-11-08 21:05:58,760 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 21:05:58,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:05:58,761 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 265 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:58,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 445 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:05:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 21:05:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 212. [2024-11-08 21:05:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 145 states have (on average 1.4068965517241379) internal successors, (204), 145 states have internal predecessors, (204), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:05:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2024-11-08 21:05:58,816 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 201 [2024-11-08 21:05:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:58,819 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2024-11-08 21:05:58,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2024-11-08 21:05:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:05:58,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:58,822 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:58,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:05:58,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:58,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash -687837110, now seen corresponding path program 1 times [2024-11-08 21:05:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834566833] [2024-11-08 21:05:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:59,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834566833] [2024-11-08 21:05:59,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834566833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:59,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:59,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:05:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3348563] [2024-11-08 21:05:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:59,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:05:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:05:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:05:59,173 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:59,517 INFO L93 Difference]: Finished difference Result 674 states and 1038 transitions. [2024-11-08 21:05:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:05:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-08 21:05:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:59,522 INFO L225 Difference]: With dead ends: 674 [2024-11-08 21:05:59,522 INFO L226 Difference]: Without dead ends: 465 [2024-11-08 21:05:59,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:05:59,524 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 267 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:59,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 416 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:05:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-08 21:05:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 249. [2024-11-08 21:05:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 182 states have (on average 1.445054945054945) internal successors, (263), 182 states have internal predecessors, (263), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:05:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 387 transitions. [2024-11-08 21:05:59,562 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 387 transitions. Word has length 201 [2024-11-08 21:05:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:59,563 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 387 transitions. [2024-11-08 21:05:59,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 387 transitions. [2024-11-08 21:05:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:05:59,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:59,565 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:05:59,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:05:59,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:59,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 61935373, now seen corresponding path program 1 times [2024-11-08 21:05:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:59,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698938825] [2024-11-08 21:05:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:05:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:05:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:05:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:05:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:05:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:05:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:05:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:05:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:05:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:05:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:05:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:05:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:05:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:05:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:05:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:05:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:05:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:05:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698938825] [2024-11-08 21:05:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698938825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:05:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223022852] [2024-11-08 21:05:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:59,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:05:59,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:05:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:59,807 INFO L87 Difference]: Start difference. First operand 249 states and 387 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:05:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:00,000 INFO L93 Difference]: Finished difference Result 494 states and 773 transitions. [2024-11-08 21:06:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:06:00,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-08 21:06:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:00,003 INFO L225 Difference]: With dead ends: 494 [2024-11-08 21:06:00,003 INFO L226 Difference]: Without dead ends: 366 [2024-11-08 21:06:00,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:06:00,005 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 107 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:00,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 403 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:06:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-08 21:06:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 245. [2024-11-08 21:06:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 178 states have (on average 1.4438202247191012) internal successors, (257), 178 states have internal predecessors, (257), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:06:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2024-11-08 21:06:00,038 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 381 transitions. Word has length 201 [2024-11-08 21:06:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:00,040 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 381 transitions. [2024-11-08 21:06:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 381 transitions. [2024-11-08 21:06:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:06:00,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:00,044 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:00,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:06:00,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -265135284, now seen corresponding path program 1 times [2024-11-08 21:06:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543147325] [2024-11-08 21:06:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:06:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:06:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:06:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:06:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:06:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:06:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:06:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:06:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:06:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:06:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:06:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:06:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:06:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:06:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:06:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:06:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:06:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:06:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:06:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:06:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:06:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:06:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:06:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:06:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:06:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:06:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:06:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:06:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543147325] [2024-11-08 21:06:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543147325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:00,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:06:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937440960] [2024-11-08 21:06:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:00,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:06:00,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:00,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:06:00,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:06:00,312 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:00,689 INFO L93 Difference]: Finished difference Result 699 states and 1075 transitions. [2024-11-08 21:06:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:06:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-08 21:06:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:00,694 INFO L225 Difference]: With dead ends: 699 [2024-11-08 21:06:00,694 INFO L226 Difference]: Without dead ends: 453 [2024-11-08 21:06:00,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:06:00,695 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 253 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:00,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 369 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:06:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-08 21:06:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 263. [2024-11-08 21:06:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 196 states have (on average 1.433673469387755) internal successors, (281), 196 states have internal predecessors, (281), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:06:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 405 transitions. [2024-11-08 21:06:00,736 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 405 transitions. Word has length 201 [2024-11-08 21:06:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:00,736 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 405 transitions. [2024-11-08 21:06:00,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 405 transitions. [2024-11-08 21:06:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:06:00,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:00,739 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:00,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:06:00,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:00,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2105036848, now seen corresponding path program 1 times [2024-11-08 21:06:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059770719] [2024-11-08 21:06:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:06:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:06:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:06:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:06:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:06:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:06:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:06:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:06:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:06:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:06:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:06:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:06:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:06:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:06:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:06:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:06:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:06:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:06:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:06:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:06:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:06:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:06:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:06:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:06:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:06:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:06:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:06:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 21:06:01,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059770719] [2024-11-08 21:06:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059770719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:06:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132571498] [2024-11-08 21:06:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:01,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:06:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:01,351 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-08 21:06:01,353 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-08 21:06:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:01,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 21:06:01,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 622 proven. 150 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-11-08 21:06:02,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:06:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 21:06:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132571498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:06:02,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:06:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2024-11-08 21:06:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552625642] [2024-11-08 21:06:02,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:06:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 21:06:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:02,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 21:06:02,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2024-11-08 21:06:02,854 INFO L87 Difference]: Start difference. First operand 263 states and 405 transitions. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-08 21:06:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:04,300 INFO L93 Difference]: Finished difference Result 919 states and 1376 transitions. [2024-11-08 21:06:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 21:06:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 201 [2024-11-08 21:06:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:04,305 INFO L225 Difference]: With dead ends: 919 [2024-11-08 21:06:04,305 INFO L226 Difference]: Without dead ends: 659 [2024-11-08 21:06:04,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 21:06:04,307 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 656 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:04,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1063 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 21:06:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-08 21:06:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 301. [2024-11-08 21:06:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 226 states have internal predecessors, (319), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-08 21:06:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 457 transitions. [2024-11-08 21:06:04,368 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 457 transitions. Word has length 201 [2024-11-08 21:06:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:04,368 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 457 transitions. [2024-11-08 21:06:04,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-08 21:06:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 457 transitions. [2024-11-08 21:06:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:06:04,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:04,372 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:04,391 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-08 21:06:04,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 21:06:04,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1796903438, now seen corresponding path program 1 times [2024-11-08 21:06:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600369843] [2024-11-08 21:06:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:06:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247486598] [2024-11-08 21:06:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:06:04,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:04,709 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-08 21:06:04,710 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-08 21:06:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:06:04,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:06:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:06:05,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:06:05,046 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:06:05,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:06:05,067 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-08 21:06:05,249 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,SelfDestructingSolverStorable10 [2024-11-08 21:06:05,253 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:05,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:06:05,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:06:05 BoogieIcfgContainer [2024-11-08 21:06:05,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:06:05,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:06:05,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:06:05,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:06:05,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:05:54" (3/4) ... [2024-11-08 21:06:05,388 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:06:05,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:06:05,390 INFO L158 Benchmark]: Toolchain (without parser) took 11603.55ms. Allocated memory was 159.4MB in the beginning and 348.1MB in the end (delta: 188.7MB). Free memory was 101.8MB in the beginning and 160.2MB in the end (delta: -58.4MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2024-11-08 21:06:05,390 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:06:05,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.59ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 84.2MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:06:05,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.90ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 80.5MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:06:05,391 INFO L158 Benchmark]: Boogie Preprocessor took 74.72ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 75.4MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:06:05,391 INFO L158 Benchmark]: RCFGBuilder took 630.73ms. Allocated memory was 159.4MB in the beginning and 241.2MB in the end (delta: 81.8MB). Free memory was 75.4MB in the beginning and 196.8MB in the end (delta: -121.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-08 21:06:05,391 INFO L158 Benchmark]: TraceAbstraction took 10451.27ms. Allocated memory was 241.2MB in the beginning and 348.1MB in the end (delta: 107.0MB). Free memory was 195.8MB in the beginning and 160.2MB in the end (delta: 35.6MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. [2024-11-08 21:06:05,392 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 348.1MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:06:05,393 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.20ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.59ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 84.2MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.90ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 80.5MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.72ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 75.4MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 630.73ms. Allocated memory was 159.4MB in the beginning and 241.2MB in the end (delta: 81.8MB). Free memory was 75.4MB in the beginning and 196.8MB in the end (delta: -121.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10451.27ms. Allocated memory was 241.2MB in the beginning and 348.1MB in the end (delta: 107.0MB). Free memory was 195.8MB in the beginning and 160.2MB in the end (delta: 35.6MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 348.1MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_46 = 0; [L53] unsigned short int var_1_49 = 0; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2, var_1_9=4000000001/4] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] FCALL updateLastVariables() [L196] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L137] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L138] var_1_11 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L139] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L140] var_1_13 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L143] var_1_14 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L144] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L145] var_1_16 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L149] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L151] var_1_19 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L152] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L157] var_1_21 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L158] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L160] var_1_22 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L161] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L163] var_1_24 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L164] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L167] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L169] var_1_26 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L170] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L172] var_1_35 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L173] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L175] var_1_39 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L176] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L178] var_1_40 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L179] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L181] var_1_41 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L182] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L196] RET updateVariables() [L197] CALL step() [L57] var_1_15 = (var_1_16 - var_1_17) [L58] var_1_27 = var_1_21 [L59] unsigned char stepLocal_1 = var_1_27; [L60] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L61] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L62] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L70] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L73] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L74] COND FALSE !(var_1_27 > stepLocal_2) [L77] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L79] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L80] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L82] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L83] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L92] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L93] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L94] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L97] COND TRUE 1 >= stepLocal_3 [L98] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L103] EXPR var_1_27 | (var_1_21 + var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L103] COND FALSE !(var_1_27 < (var_1_27 | (var_1_21 + var_1_27))) [L106] EXPR var_1_21 >> var_1_21 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L106] COND TRUE var_1_21 >= (var_1_21 >> var_1_21) [L107] COND FALSE !(var_1_23 || (var_1_17 < var_1_21)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L111] COND FALSE !(var_1_27 > (var_1_20 / var_1_35)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L114] COND TRUE 63.75f <= var_1_11 [L115] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L117] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27)))) [L120] var_1_42 = (var_1_25 || var_1_25) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L122] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L129] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 11, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1839 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1781 mSDsluCounter, 4031 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2456 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2137 IncrementalHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 1575 mSDtfsCounter, 2137 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1127 GetRequests, 1065 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=10, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1210 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2605 NumberOfCodeBlocks, 2605 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 5643 SizeOfPredicates, 8 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 22032/22320 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-08 21:06:05,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.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 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:06:07,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:06:07,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:06:07,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:06:07,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:06:07,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:06:07,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:06:07,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:06:07,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:06:07,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:06:07,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:06:07,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:06:07,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:06:07,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:06:07,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:06:07,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:06:07,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:06:07,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:06:07,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:06:07,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:06:07,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:06:07,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:06:07,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:06:07,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:06:07,821 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:06:07,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:06:07,822 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:06:07,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:06:07,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:06:07,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:06:07,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:06:07,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:06:07,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:06:07,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:06:07,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:07,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:06:07,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:06:07,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:06:07,834 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:06:07,834 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:06:07,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:06:07,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:06:07,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:06:07,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:06:07,837 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 -> 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc [2024-11-08 21:06:08,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:06:08,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:06:08,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:06:08,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:06:08,187 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:06:08,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-11-08 21:06:09,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:06:10,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:06:10,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-11-08 21:06:10,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07e9f2f3/2be7e0ca358a4093a35af77814ee1de1/FLAG360edc678 [2024-11-08 21:06:10,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07e9f2f3/2be7e0ca358a4093a35af77814ee1de1 [2024-11-08 21:06:10,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:06:10,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:06:10,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:06:10,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:06:10,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:06:10,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1613121b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10, skipping insertion in model container [2024-11-08 21:06:10,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:06:10,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-11-08 21:06:10,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:06:10,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:06:10,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-11-08 21:06:10,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:06:10,509 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:06:10,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10 WrapperNode [2024-11-08 21:06:10,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:06:10,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:06:10,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:06:10,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:06:10,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,575 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-08 21:06:10,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:06:10,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:06:10,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:06:10,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:06:10,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,622 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-08 21:06:10,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:06:10,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:06:10,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:06:10,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:06:10,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (1/1) ... [2024-11-08 21:06:10,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:10,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:10,704 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-08 21:06:10,710 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-08 21:06:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:06:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:06:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:06:10,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:06:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:06:10,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:06:10,859 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:06:10,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:06:11,363 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:06:11,363 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:06:11,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:06:11,379 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:06:11,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:11 BoogieIcfgContainer [2024-11-08 21:06:11,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:06:11,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:06:11,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:06:11,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:06:11,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:06:10" (1/3) ... [2024-11-08 21:06:11,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439b1c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:06:11, skipping insertion in model container [2024-11-08 21:06:11,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:10" (2/3) ... [2024-11-08 21:06:11,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439b1c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:06:11, skipping insertion in model container [2024-11-08 21:06:11,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:11" (3/3) ... [2024-11-08 21:06:11,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-11-08 21:06:11,409 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:06:11,410 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:06:11,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:06:11,478 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;@46337b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:06:11,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:06:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:06:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:06:11,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:11,503 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:11,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -916903089, now seen corresponding path program 1 times [2024-11-08 21:06:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711223011] [2024-11-08 21:06:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:11,522 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-08 21:06:11,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:11,525 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-08 21:06:11,526 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-08 21:06:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:11,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:06:11,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2024-11-08 21:06:11,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:06:11,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:06:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711223011] [2024-11-08 21:06:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711223011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:06:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708849703] [2024-11-08 21:06:11,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:06:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:06:11,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:06:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:06:11,960 INFO L87 Difference]: Start difference. First operand has 91 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 21:06:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:11,989 INFO L93 Difference]: Finished difference Result 175 states and 315 transitions. [2024-11-08 21:06:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:06:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-11-08 21:06:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:12,002 INFO L225 Difference]: With dead ends: 175 [2024-11-08 21:06:12,002 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 21:06:12,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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-08 21:06:12,020 INFO L432 NwaCegarLoop]: 137 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, 137 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-08 21:06:12,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:06:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 21:06:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 21:06:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:06:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2024-11-08 21:06:12,075 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 197 [2024-11-08 21:06:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:12,075 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2024-11-08 21:06:12,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 21:06:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2024-11-08 21:06:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:06:12,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:12,080 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:12,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:06:12,281 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-08 21:06:12,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:12,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 140297933, now seen corresponding path program 1 times [2024-11-08 21:06:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357697113] [2024-11-08 21:06:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:12,284 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-08 21:06:12,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:12,288 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-08 21:06:12,289 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-08 21:06:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:12,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 21:06:12,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-08 21:06:13,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:06:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:06:13,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:06:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357697113] [2024-11-08 21:06:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357697113] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 21:06:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:06:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-08 21:06:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105547875] [2024-11-08 21:06:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:13,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:06:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:06:13,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:06:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:06:13,405 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:13,541 INFO L93 Difference]: Finished difference Result 171 states and 271 transitions. [2024-11-08 21:06:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:06:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-11-08 21:06:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:13,544 INFO L225 Difference]: With dead ends: 171 [2024-11-08 21:06:13,544 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 21:06:13,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:06:13,551 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:13,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:06:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 21:06:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 21:06:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 21:06:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-08 21:06:13,575 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 197 [2024-11-08 21:06:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:13,579 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-08 21:06:13,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-08 21:06:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:06:13,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:13,582 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:13,597 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-08 21:06:13,786 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-08 21:06:13,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1448049969, now seen corresponding path program 1 times [2024-11-08 21:06:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444182233] [2024-11-08 21:06:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:13,790 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-08 21:06:13,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:13,793 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-08 21:06:13,794 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-08 21:06:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:14,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:06:14,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:06:14,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:06:14,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:06:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444182233] [2024-11-08 21:06:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444182233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:06:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960448538] [2024-11-08 21:06:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:14,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:06:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:06:14,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:06:14,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:06:14,355 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:14,443 INFO L93 Difference]: Finished difference Result 255 states and 402 transitions. [2024-11-08 21:06:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:06:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-11-08 21:06:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:14,447 INFO L225 Difference]: With dead ends: 255 [2024-11-08 21:06:14,447 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 21:06:14,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 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-08 21:06:14,449 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 37 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:14,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:06:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 21:06:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-08 21:06:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:06:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 267 transitions. [2024-11-08 21:06:14,485 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 267 transitions. Word has length 197 [2024-11-08 21:06:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 267 transitions. [2024-11-08 21:06:14,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 267 transitions. [2024-11-08 21:06:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:06:14,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:14,494 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:14,506 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-08 21:06:14,694 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-08 21:06:14,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:14,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1257491759, now seen corresponding path program 1 times [2024-11-08 21:06:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:14,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738351616] [2024-11-08 21:06:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:14,697 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-08 21:06:14,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:14,703 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-08 21:06:14,704 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-08 21:06:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:14,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:06:14,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 940 proven. 51 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2024-11-08 21:06:15,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:06:15,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:06:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738351616] [2024-11-08 21:06:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738351616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:06:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [239045569] [2024-11-08 21:06:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:06:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:06:15,183 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-08 21:06:15,184 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-08 21:06:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:15,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:06:15,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 21:06:16,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:06:16,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [239045569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:16,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:06:16,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-08 21:06:16,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898673045] [2024-11-08 21:06:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:16,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:06:16,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:06:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:06:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:06:16,029 INFO L87 Difference]: Start difference. First operand 169 states and 267 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:16,854 INFO L93 Difference]: Finished difference Result 502 states and 790 transitions. [2024-11-08 21:06:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:06:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-11-08 21:06:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:16,859 INFO L225 Difference]: With dead ends: 502 [2024-11-08 21:06:16,859 INFO L226 Difference]: Without dead ends: 336 [2024-11-08 21:06:16,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:06:16,861 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 210 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:16,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 459 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:06:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-08 21:06:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 225. [2024-11-08 21:06:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 146 states have internal predecessors, (195), 75 states have call successors, (75), 4 states have call predecessors, (75), 4 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-08 21:06:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 345 transitions. [2024-11-08 21:06:16,900 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 345 transitions. Word has length 198 [2024-11-08 21:06:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:16,901 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 345 transitions. [2024-11-08 21:06:16,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 21:06:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 345 transitions. [2024-11-08 21:06:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:06:16,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:16,904 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:16,916 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 (5)] Ended with exit code 0 [2024-11-08 21:06:17,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-08 21:06:17,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:06:17,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1928005198, now seen corresponding path program 1 times [2024-11-08 21:06:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007459628] [2024-11-08 21:06:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:17,308 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-08 21:06:17,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:17,311 INFO L229 MonitoredProcess]: Starting monitored process 7 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-08 21:06:17,312 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 (7)] Waiting until timeout for monitored process [2024-11-08 21:06:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:17,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 21:06:17,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1085 proven. 159 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-08 21:06:18,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:06:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 21:06:20,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:06:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007459628] [2024-11-08 21:06:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007459628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:06:20,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:06:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2024-11-08 21:06:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957633062] [2024-11-08 21:06:20,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:06:20,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 21:06:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:06:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 21:06:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2024-11-08 21:06:20,004 INFO L87 Difference]: Start difference. First operand 225 states and 345 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-08 21:06:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:25,007 INFO L93 Difference]: Finished difference Result 1304 states and 1913 transitions. [2024-11-08 21:06:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-08 21:06:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) Word has length 199 [2024-11-08 21:06:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:25,024 INFO L225 Difference]: With dead ends: 1304 [2024-11-08 21:06:25,025 INFO L226 Difference]: Without dead ends: 1104 [2024-11-08 21:06:25,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1677, Invalid=3293, Unknown=0, NotChecked=0, Total=4970 [2024-11-08 21:06:25,029 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1331 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:25,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 816 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 21:06:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-08 21:06:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 416. [2024-11-08 21:06:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 286 states have (on average 1.3216783216783217) internal successors, (378), 288 states have internal predecessors, (378), 113 states have call successors, (113), 16 states have call predecessors, (113), 16 states have return successors, (113), 111 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-08 21:06:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 604 transitions. [2024-11-08 21:06:25,098 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 604 transitions. Word has length 199 [2024-11-08 21:06:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:25,101 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 604 transitions. [2024-11-08 21:06:25,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-08 21:06:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 604 transitions. [2024-11-08 21:06:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:06:25,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:25,104 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:06:25,116 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 (7)] Ended with exit code 0 [2024-11-08 21:06:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-08 21:06:25,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -304923376, now seen corresponding path program 1 times [2024-11-08 21:06:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284795382] [2024-11-08 21:06:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:25,306 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-08 21:06:25,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:25,308 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08 21:06:25,309 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 (8)] Waiting until timeout for monitored process [2024-11-08 21:06:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:25,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 21:06:25,498 INFO L278 TraceCheckSpWp]: Computing forward predicates...