./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-42.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 31e8a7a0843c772098719b84de8901608b22406a362aed74107619be02c74764 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:43:43,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:43:44,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:43:44,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:43:44,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:43:44,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:43:44,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:43:44,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:43:44,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:43:44,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:43:44,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:43:44,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:43:44,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:43:44,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:43:44,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:43:44,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:43:44,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:43:44,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:43:44,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:43:44,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:43:44,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:43:44,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:43:44,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:43:44,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:43:44,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:43:44,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:43:44,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:43:44,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:43:44,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:43:44,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:43:44,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:43:44,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:43:44,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:43:44,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:43:44,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:43:44,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:43:44,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:43:44,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:43:44,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:43:44,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:43:44,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:43:44,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:43:44,141 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 -> 31e8a7a0843c772098719b84de8901608b22406a362aed74107619be02c74764 [2024-11-12 03:43:44,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:43:44,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:43:44,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:43:44,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:43:44,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:43:44,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-42.i [2024-11-12 03:43:45,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:43:46,059 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:43:46,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-42.i [2024-11-12 03:43:46,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63998673/6b18f9c653574841ae095a21b707987c/FLAG4244cc783 [2024-11-12 03:43:46,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63998673/6b18f9c653574841ae095a21b707987c [2024-11-12 03:43:46,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:43:46,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:43:46,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:43:46,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:43:46,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:43:46,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df829d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46, skipping insertion in model container [2024-11-12 03:43:46,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:43:46,672 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-pr-co_file-42.i[919,932] [2024-11-12 03:43:46,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:43:46,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:43:46,769 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-pr-co_file-42.i[919,932] [2024-11-12 03:43:46,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:43:46,823 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:43:46,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46 WrapperNode [2024-11-12 03:43:46,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:43:46,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:43:46,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:43:46,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:43:46,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,893 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-11-12 03:43:46,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:43:46,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:43:46,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:43:46,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:43:46,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,932 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:43:46,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:43:46,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:43:46,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:43:46,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:43:46,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (1/1) ... [2024-11-12 03:43:46,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:43:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:43:47,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:43:47,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:43:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:43:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:43:47,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:43:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:43:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:43:47,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:43:47,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:43:47,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:43:47,608 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 03:43:47,608 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:43:47,624 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:43:47,624 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:43:47,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:43:47 BoogieIcfgContainer [2024-11-12 03:43:47,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:43:47,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:43:47,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:43:47,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:43:47,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:43:46" (1/3) ... [2024-11-12 03:43:47,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e054c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:43:47, skipping insertion in model container [2024-11-12 03:43:47,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:43:46" (2/3) ... [2024-11-12 03:43:47,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e054c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:43:47, skipping insertion in model container [2024-11-12 03:43:47,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:43:47" (3/3) ... [2024-11-12 03:43:47,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-42.i [2024-11-12 03:43:47,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:43:47,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:43:47,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:43:47,738 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;@5d61bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:43:47,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:43:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 03:43:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:43:47,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:47,761 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:47,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:47,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1803564380, now seen corresponding path program 1 times [2024-11-12 03:43:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961826142] [2024-11-12 03:43:47,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:43:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:43:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:43:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:43:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:43:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:43:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:43:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:43:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:43:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:43:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:43:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:43:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:43:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:43:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:43:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:43:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:43:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:43:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:43:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:43:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:43:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:43:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:43:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:43:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 03:43:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:43:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 03:43:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 03:43:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 03:43:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:43:48,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:48,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961826142] [2024-11-12 03:43:48,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961826142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:43:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:43:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:43:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666524129] [2024-11-12 03:43:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:43:48,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:43:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:48,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:43:48,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:43:48,396 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:43:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:48,480 INFO L93 Difference]: Finished difference Result 171 states and 305 transitions. [2024-11-12 03:43:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:43:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-12 03:43:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:48,498 INFO L225 Difference]: With dead ends: 171 [2024-11-12 03:43:48,498 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 03:43:48,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:43:48,506 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:48,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:43:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 03:43:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 03:43:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 03:43:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2024-11-12 03:43:48,564 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 190 [2024-11-12 03:43:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2024-11-12 03:43:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:43:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2024-11-12 03:43:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:43:48,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:48,572 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:48,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:43:48,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:48,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1667312998, now seen corresponding path program 1 times [2024-11-12 03:43:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:48,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517128451] [2024-11-12 03:43:48,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:43:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:43:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:43:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:43:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:43:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:43:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:43:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:43:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:43:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:43:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:43:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:43:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:43:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:43:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:43:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:43:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:43:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:43:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:43:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:43:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:43:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:43:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:43:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:43:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 03:43:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:43:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 03:43:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 03:43:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 03:43:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:43:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517128451] [2024-11-12 03:43:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517128451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:43:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:43:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:43:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441139833] [2024-11-12 03:43:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:43:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:43:48,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:43:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:43:48,960 INFO L87 Difference]: Start difference. First operand 85 states and 134 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:49,039 INFO L93 Difference]: Finished difference Result 248 states and 394 transitions. [2024-11-12 03:43:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:43:49,041 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-12 03:43:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:49,048 INFO L225 Difference]: With dead ends: 248 [2024-11-12 03:43:49,049 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 03:43:49,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:43:49,052 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 127 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:49,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 272 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:43:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 03:43:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-12 03:43:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-12 03:43:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 260 transitions. [2024-11-12 03:43:49,101 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 260 transitions. Word has length 190 [2024-11-12 03:43:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:49,104 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 260 transitions. [2024-11-12 03:43:49,104 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 260 transitions. [2024-11-12 03:43:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:43:49,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:49,110 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:49,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:43:49,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -107694364, now seen corresponding path program 1 times [2024-11-12 03:43:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:49,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321917887] [2024-11-12 03:43:49,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:43:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:43:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:43:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:43:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:43:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:43:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:43:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:43:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:43:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:43:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:43:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:43:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:43:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:43:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:43:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:43:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:43:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:43:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:43:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:43:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:43:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:43:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:43:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:43:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 03:43:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:43:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 03:43:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 03:43:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 03:43:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:43:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321917887] [2024-11-12 03:43:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321917887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:43:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:43:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:43:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200089332] [2024-11-12 03:43:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:43:49,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:43:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:49,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:43:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:43:49,687 INFO L87 Difference]: Start difference. First operand 164 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:49,887 INFO L93 Difference]: Finished difference Result 429 states and 681 transitions. [2024-11-12 03:43:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:43:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-12 03:43:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:49,894 INFO L225 Difference]: With dead ends: 429 [2024-11-12 03:43:49,896 INFO L226 Difference]: Without dead ends: 268 [2024-11-12 03:43:49,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:43:49,899 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 117 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:49,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 381 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:43:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-12 03:43:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 237. [2024-11-12 03:43:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 146 states have internal predecessors, (204), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-12 03:43:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 378 transitions. [2024-11-12 03:43:49,954 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 378 transitions. Word has length 190 [2024-11-12 03:43:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:49,955 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 378 transitions. [2024-11-12 03:43:49,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 378 transitions. [2024-11-12 03:43:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:43:49,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:49,978 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:43:49,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1402871393, now seen corresponding path program 1 times [2024-11-12 03:43:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177475906] [2024-11-12 03:43:49,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:43:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:43:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:43:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:43:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:43:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:43:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:43:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:43:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:43:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:43:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:43:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:43:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:43:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:43:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:43:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:43:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:43:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:43:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:43:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:43:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:43:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:43:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:43:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:43:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 03:43:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:43:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 03:43:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 03:43:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 03:43:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:43:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177475906] [2024-11-12 03:43:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177475906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:43:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:43:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:43:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66453141] [2024-11-12 03:43:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:43:50,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:43:50,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:43:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:43:50,569 INFO L87 Difference]: Start difference. First operand 237 states and 378 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:51,010 INFO L93 Difference]: Finished difference Result 611 states and 982 transitions. [2024-11-12 03:43:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:43:51,011 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-12 03:43:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:51,016 INFO L225 Difference]: With dead ends: 611 [2024-11-12 03:43:51,016 INFO L226 Difference]: Without dead ends: 430 [2024-11-12 03:43:51,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:43:51,018 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 162 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:51,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 524 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:43:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-12 03:43:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 328. [2024-11-12 03:43:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 207 states have (on average 1.4009661835748792) internal successors, (290), 207 states have internal predecessors, (290), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-12 03:43:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 522 transitions. [2024-11-12 03:43:51,080 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 522 transitions. Word has length 191 [2024-11-12 03:43:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:51,081 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 522 transitions. [2024-11-12 03:43:51,081 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 522 transitions. [2024-11-12 03:43:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:43:51,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:51,084 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:51,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:43:51,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:51,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1536884899, now seen corresponding path program 1 times [2024-11-12 03:43:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:51,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021489731] [2024-11-12 03:43:51,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:43:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:43:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:43:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:43:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:43:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:43:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:43:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:43:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:43:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:43:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:43:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:43:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:43:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:43:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:43:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:43:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:43:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:43:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:43:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:43:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:43:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:43:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:43:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:43:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 03:43:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:43:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 03:43:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 03:43:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 03:43:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:43:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021489731] [2024-11-12 03:43:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021489731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:43:51,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:43:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:43:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600762993] [2024-11-12 03:43:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:43:51,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:43:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:43:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:43:51,390 INFO L87 Difference]: Start difference. First operand 328 states and 522 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:51,446 INFO L93 Difference]: Finished difference Result 578 states and 921 transitions. [2024-11-12 03:43:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:43:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-12 03:43:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:51,450 INFO L225 Difference]: With dead ends: 578 [2024-11-12 03:43:51,452 INFO L226 Difference]: Without dead ends: 328 [2024-11-12 03:43:51,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:43:51,454 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:51,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:43:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-12 03:43:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-12 03:43:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 207 states have (on average 1.3768115942028984) internal successors, (285), 207 states have internal predecessors, (285), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-12 03:43:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 517 transitions. [2024-11-12 03:43:51,497 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 517 transitions. Word has length 191 [2024-11-12 03:43:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:51,498 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 517 transitions. [2024-11-12 03:43:51,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:43:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 517 transitions. [2024-11-12 03:43:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:43:51,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:51,501 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:51,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:43:51,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -835820321, now seen corresponding path program 1 times [2024-11-12 03:43:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606336279] [2024-11-12 03:43:51,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:43:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:43:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:43:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:43:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:43:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:43:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:43:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:43:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:43:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:43:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:43:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:43:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:43:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:43:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:43:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:43:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:43:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:43:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:43:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:43:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:43:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:43:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:43:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:43:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 03:43:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:43:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 03:43:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 03:43:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 03:43:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-12 03:43:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606336279] [2024-11-12 03:43:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606336279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:43:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381916355] [2024-11-12 03:43:52,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:52,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:43:52,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:43:52,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:43:52,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 03:43:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:52,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 03:43:52,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:43:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-12 03:43:53,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:43:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-12 03:43:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381916355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:43:53,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:43:53,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2024-11-12 03:43:53,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104395352] [2024-11-12 03:43:53,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:43:53,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 03:43:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 03:43:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-12 03:43:53,725 INFO L87 Difference]: Start difference. First operand 328 states and 517 transitions. Second operand has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 5 states have call successors, (79), 3 states have call predecessors, (79), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2024-11-12 03:43:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:56,560 INFO L93 Difference]: Finished difference Result 767 states and 1126 transitions. [2024-11-12 03:43:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-12 03:43:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 5 states have call successors, (79), 3 states have call predecessors, (79), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 191 [2024-11-12 03:43:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:56,565 INFO L225 Difference]: With dead ends: 767 [2024-11-12 03:43:56,565 INFO L226 Difference]: Without dead ends: 602 [2024-11-12 03:43:56,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 436 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1395, Invalid=5085, Unknown=0, NotChecked=0, Total=6480 [2024-11-12 03:43:56,570 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 763 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:56,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 833 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 03:43:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-12 03:43:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 560. [2024-11-12 03:43:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 361 states have (on average 1.3019390581717452) internal successors, (470), 361 states have internal predecessors, (470), 174 states have call successors, (174), 24 states have call predecessors, (174), 24 states have return successors, (174), 174 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-12 03:43:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 818 transitions. [2024-11-12 03:43:56,653 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 818 transitions. Word has length 191 [2024-11-12 03:43:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:56,656 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 818 transitions. [2024-11-12 03:43:56,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 5 states have call successors, (79), 3 states have call predecessors, (79), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2024-11-12 03:43:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 818 transitions. [2024-11-12 03:43:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:43:56,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:56,658 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:56,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 03:43:56,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 03:43:56,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:56,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1377176223, now seen corresponding path program 1 times [2024-11-12 03:43:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805103364] [2024-11-12 03:43:56,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:43:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437268536] [2024-11-12 03:43:56,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:56,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:43:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:43:56,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:43:56,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 03:43:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:43:57,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 03:43:57,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:43:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-12 03:43:58,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:43:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:43:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805103364] [2024-11-12 03:43:58,656 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:43:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437268536] [2024-11-12 03:43:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437268536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:43:58,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:43:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-12 03:43:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762512127] [2024-11-12 03:43:58,657 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 03:43:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 03:43:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:43:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 03:43:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=113, Unknown=3, NotChecked=0, Total=156 [2024-11-12 03:43:58,659 INFO L87 Difference]: Start difference. First operand 560 states and 818 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:43:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:43:59,458 INFO L93 Difference]: Finished difference Result 1437 states and 2058 transitions. [2024-11-12 03:43:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 03:43:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-12 03:43:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:43:59,469 INFO L225 Difference]: With dead ends: 1437 [2024-11-12 03:43:59,469 INFO L226 Difference]: Without dead ends: 1244 [2024-11-12 03:43:59,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=386, Unknown=3, NotChecked=0, Total=552 [2024-11-12 03:43:59,471 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 226 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 77 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:43:59,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 732 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 484 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:43:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-12 03:43:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1089. [2024-11-12 03:43:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 719 states have (on average 1.305980528511822) internal successors, (939), 721 states have internal predecessors, (939), 323 states have call successors, (323), 46 states have call predecessors, (323), 46 states have return successors, (323), 321 states have call predecessors, (323), 323 states have call successors, (323) [2024-11-12 03:43:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1585 transitions. [2024-11-12 03:43:59,672 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1585 transitions. Word has length 191 [2024-11-12 03:43:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:43:59,673 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1585 transitions. [2024-11-12 03:43:59,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:43:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1585 transitions. [2024-11-12 03:43:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:43:59,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:43:59,676 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:43:59,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 03:43:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-12 03:43:59,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:43:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:43:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -223941473, now seen corresponding path program 1 times [2024-11-12 03:43:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:43:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173132901] [2024-11-12 03:43:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:43:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:43:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705795564] [2024-11-12 03:43:59,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:43:59,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:43:59,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:43:59,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:43:59,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:44:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:00,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 03:44:00,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-12 03:44:01,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:44:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:44:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173132901] [2024-11-12 03:44:02,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:44:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705795564] [2024-11-12 03:44:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705795564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:44:02,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:44:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-12 03:44:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650048573] [2024-11-12 03:44:02,178 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 03:44:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:44:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:44:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:44:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-12 03:44:02,180 INFO L87 Difference]: Start difference. First operand 1089 states and 1585 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:44:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:03,117 INFO L93 Difference]: Finished difference Result 2213 states and 3222 transitions. [2024-11-12 03:44:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 03:44:03,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-12 03:44:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:03,127 INFO L225 Difference]: With dead ends: 2213 [2024-11-12 03:44:03,127 INFO L226 Difference]: Without dead ends: 1220 [2024-11-12 03:44:03,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-11-12 03:44:03,131 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 147 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 72 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:03,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 989 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 673 Invalid, 10 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:44:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-11-12 03:44:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1094. [2024-11-12 03:44:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 724 states have (on average 1.2969613259668509) internal successors, (939), 726 states have internal predecessors, (939), 323 states have call successors, (323), 46 states have call predecessors, (323), 46 states have return successors, (323), 321 states have call predecessors, (323), 323 states have call successors, (323) [2024-11-12 03:44:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1585 transitions. [2024-11-12 03:44:03,256 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1585 transitions. Word has length 191 [2024-11-12 03:44:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:03,256 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1585 transitions. [2024-11-12 03:44:03,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:44:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1585 transitions. [2024-11-12 03:44:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 03:44:03,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:03,259 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:03,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 03:44:03,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:44:03,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -370845225, now seen corresponding path program 1 times [2024-11-12 03:44:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:44:03,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17264257] [2024-11-12 03:44:03,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:03,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:44:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:44:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755281625] [2024-11-12 03:44:03,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:44:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:44:03,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:44:03,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 03:44:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:44:03,714 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:44:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:44:03,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:44:03,911 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:44:03,912 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:44:03,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 03:44:04,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:44:04,118 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:04,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:44:04,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:44:04 BoogieIcfgContainer [2024-11-12 03:44:04,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:44:04,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:44:04,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:44:04,275 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:44:04,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:43:47" (3/4) ... [2024-11-12 03:44:04,278 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:44:04,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:44:04,280 INFO L158 Benchmark]: Toolchain (without parser) took 17854.59ms. Allocated memory was 134.2MB in the beginning and 415.2MB in the end (delta: 281.0MB). Free memory was 64.6MB in the beginning and 316.4MB in the end (delta: -251.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,280 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:44:04,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.69ms. Allocated memory was 134.2MB in the beginning and 199.2MB in the end (delta: 65.0MB). Free memory was 64.3MB in the beginning and 162.8MB in the end (delta: -98.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.38ms. Allocated memory is still 199.2MB. Free memory was 162.8MB in the beginning and 158.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,281 INFO L158 Benchmark]: Boogie Preprocessor took 66.94ms. Allocated memory is still 199.2MB. Free memory was 158.6MB in the beginning and 152.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,281 INFO L158 Benchmark]: RCFGBuilder took 663.56ms. Allocated memory is still 199.2MB. Free memory was 152.4MB in the beginning and 123.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,281 INFO L158 Benchmark]: TraceAbstraction took 16646.27ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 121.9MB in the beginning and 317.5MB in the end (delta: -195.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,282 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 415.2MB. Free memory was 317.5MB in the beginning and 316.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:44:04,284 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.19ms. Allocated memory is still 134.2MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.69ms. Allocated memory was 134.2MB in the beginning and 199.2MB in the end (delta: 65.0MB). Free memory was 64.3MB in the beginning and 162.8MB in the end (delta: -98.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.38ms. Allocated memory is still 199.2MB. Free memory was 162.8MB in the beginning and 158.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.94ms. Allocated memory is still 199.2MB. Free memory was 158.6MB in the beginning and 152.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 663.56ms. Allocated memory is still 199.2MB. Free memory was 152.4MB in the beginning and 123.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16646.27ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 121.9MB in the beginning and 317.5MB in the end (delta: -195.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 415.2MB. Free memory was 317.5MB in the beginning and 316.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_25 = 1; [L38] float var_1_26 = 500.65; [L39] signed long int var_1_27 = -8; [L40] float var_1_28 = 255.5; [L41] float var_1_29 = 7.5; [L42] float var_1_30 = 9.8; [L43] unsigned char var_1_31 = 4; [L44] unsigned char var_1_33 = 2; [L45] unsigned short int var_1_34 = 1; [L46] unsigned long int var_1_35 = 10; [L47] unsigned char var_1_36 = 10; [L48] unsigned char var_1_37 = 128; [L49] unsigned char var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned short int var_1_40 = 10; [L52] unsigned short int var_1_41 = 128; [L53] unsigned short int var_1_42 = 40597; [L54] signed short int last_1_var_1_1 = 16; [L55] unsigned char last_1_var_1_6 = 10; [L56] unsigned char last_1_var_1_8 = 1; [L57] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_1 = var_1_1 [L195] last_1_var_1_6 = var_1_6 [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_5 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L148] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L149] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L150] var_1_7 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L155] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L156] var_1_12 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L157] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L159] var_1_15 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L160] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L173] var_1_28 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L174] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L175] var_1_29 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L176] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L180] var_1_37 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L181] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L182] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L183] var_1_38 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L186] var_1_39 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L187] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L188] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L189] var_1_42 = __VERIFIER_nondet_ushort() [L190] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L190] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L191] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L191] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L208] RET updateVariables() [L209] CALL step() [L61] signed long int stepLocal_6 = last_1_var_1_1; [L62] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L63] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L64] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L67] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L72] COND TRUE (- var_1_28) < ((((var_1_14) > (var_1_29)) ? (var_1_14) : (var_1_29))) [L73] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L75] COND TRUE \read(var_1_25) [L76] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L78] COND TRUE \read(var_1_25) [L79] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L83] COND FALSE !(var_1_33 <= (~ var_1_1)) [L88] var_1_41 = var_1_1 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L90] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L93] COND TRUE var_1_5 >= -2 [L94] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L96] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_1)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_1))) <= var_1_13 [L97] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L99] COND TRUE (- var_1_1) != var_1_13 [L100] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L102] unsigned char stepLocal_4 = var_1_6; [L103] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L104] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L105] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L106] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L113] COND FALSE !(((var_1_1 + 25) % var_1_27) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L116] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L117] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L120] COND FALSE !(var_1_6 < ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L123] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L124] COND TRUE \read(var_1_19) [L125] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L131] COND TRUE var_1_8 || var_1_19 [L132] var_1_21 = ((var_1_17 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L134] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L135] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L136] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L143] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=42, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 1542 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1542 mSDsluCounter, 4115 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2884 mSDsCounter, 734 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2503 IncrementalHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 734 mSolverCounterUnsat, 1231 mSDtfsCounter, 2503 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1604 GetRequests, 1466 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1094occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 458 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2482 NumberOfCodeBlocks, 2482 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1897 ConstructedInterpolants, 2 QuantifiedInterpolants, 9154 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1363 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 15781/16240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 03:44:04,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-42.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 31e8a7a0843c772098719b84de8901608b22406a362aed74107619be02c74764 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:44:06,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:44:06,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:44:06,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:44:06,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:44:06,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:44:06,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:44:06,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:44:06,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:44:06,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:44:06,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:44:06,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:44:06,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:44:06,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:44:06,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:44:06,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:44:06,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:44:06,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:44:06,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:44:06,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:44:06,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:44:06,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:44:06,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:44:06,737 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:44:06,737 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:44:06,737 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:44:06,737 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:44:06,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:44:06,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:44:06,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:44:06,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:44:06,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:44:06,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:44:06,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:44:06,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:44:06,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:44:06,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:44:06,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:44:06,740 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:44:06,741 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:06,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:44:06,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:44:06,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:44:06,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:44:06,742 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 -> 31e8a7a0843c772098719b84de8901608b22406a362aed74107619be02c74764 [2024-11-12 03:44:07,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:44:07,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:44:07,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:44:07,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:44:07,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:44:07,128 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-pr-co_file-42.i [2024-11-12 03:44:08,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:44:08,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:44:08,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-42.i [2024-11-12 03:44:08,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92018c2c4/b6fc776479f0472587520405df66564f/FLAG47c9f7157 [2024-11-12 03:44:08,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92018c2c4/b6fc776479f0472587520405df66564f [2024-11-12 03:44:08,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:44:08,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:44:08,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:44:08,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:44:08,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:44:08,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:44:08" (1/1) ... [2024-11-12 03:44:08,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5221d185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:08, skipping insertion in model container [2024-11-12 03:44:08,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:44:08" (1/1) ... [2024-11-12 03:44:08,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:44:09,142 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-pr-co_file-42.i[919,932] [2024-11-12 03:44:09,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:44:09,293 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:44:09,306 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-pr-co_file-42.i[919,932] [2024-11-12 03:44:09,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:44:09,385 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:44:09,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09 WrapperNode [2024-11-12 03:44:09,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:44:09,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:44:09,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:44:09,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:44:09,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,456 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-12 03:44:09,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:44:09,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:44:09,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:44:09,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:44:09,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,501 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:44:09,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:44:09,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:44:09,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:44:09,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:44:09,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (1/1) ... [2024-11-12 03:44:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:44:09,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:44:09,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:44:09,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:44:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:44:09,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:44:09,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:44:09,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:44:10,417 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 03:44:10,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:44:10,434 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:44:10,435 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:44:10,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:44:10 BoogieIcfgContainer [2024-11-12 03:44:10,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:44:10,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:44:10,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:44:10,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:44:10,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:44:08" (1/3) ... [2024-11-12 03:44:10,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8eaba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:44:10, skipping insertion in model container [2024-11-12 03:44:10,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:44:09" (2/3) ... [2024-11-12 03:44:10,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8eaba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:44:10, skipping insertion in model container [2024-11-12 03:44:10,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:44:10" (3/3) ... [2024-11-12 03:44:10,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-42.i [2024-11-12 03:44:10,464 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:44:10,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:44:10,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:44:10,532 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;@1eab070c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:44:10,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:44:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 03:44:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:44:10,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:10,552 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:10,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:10,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1803564380, now seen corresponding path program 1 times [2024-11-12 03:44:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107653916] [2024-11-12 03:44:10,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:10,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:10,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:10,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 03:44:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:10,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:44:10,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-12 03:44:11,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:44:11,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107653916] [2024-11-12 03:44:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107653916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:44:11,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:44:11,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:44:11,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671567040] [2024-11-12 03:44:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:44:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:44:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:44:11,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:44:11,086 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:44:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:11,120 INFO L93 Difference]: Finished difference Result 171 states and 305 transitions. [2024-11-12 03:44:11,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:44:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-12 03:44:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:11,129 INFO L225 Difference]: With dead ends: 171 [2024-11-12 03:44:11,129 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 03:44:11,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:44:11,135 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:11,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:44:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 03:44:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 03:44:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 03:44:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2024-11-12 03:44:11,177 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 190 [2024-11-12 03:44:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:11,177 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2024-11-12 03:44:11,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:44:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2024-11-12 03:44:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:44:11,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:11,182 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:11,192 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-12 03:44:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:11,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1667312998, now seen corresponding path program 1 times [2024-11-12 03:44:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020199048] [2024-11-12 03:44:11,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:11,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:11,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 03:44:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:11,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 03:44:11,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:44:12,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:44:12,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020199048] [2024-11-12 03:44:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020199048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:44:12,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:44:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:44:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210377285] [2024-11-12 03:44:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:44:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:44:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:44:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:44:12,166 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:12,635 INFO L93 Difference]: Finished difference Result 250 states and 397 transitions. [2024-11-12 03:44:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:44:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-12 03:44:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:12,645 INFO L225 Difference]: With dead ends: 250 [2024-11-12 03:44:12,646 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 03:44:12,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:44:12,649 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 114 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:12,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 381 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:44:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 03:44:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2024-11-12 03:44:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-12 03:44:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 252 transitions. [2024-11-12 03:44:12,680 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 252 transitions. Word has length 190 [2024-11-12 03:44:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:12,681 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 252 transitions. [2024-11-12 03:44:12,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 252 transitions. [2024-11-12 03:44:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:44:12,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:12,685 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:12,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 03:44:12,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:12,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:12,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1402871393, now seen corresponding path program 1 times [2024-11-12 03:44:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:12,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719360746] [2024-11-12 03:44:12,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:12,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:12,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 03:44:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:13,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:44:13,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:44:14,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:44:14,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719360746] [2024-11-12 03:44:14,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719360746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:44:14,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:44:14,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:44:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800133975] [2024-11-12 03:44:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:44:14,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:44:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:44:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:44:14,250 INFO L87 Difference]: Start difference. First operand 158 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:15,641 INFO L93 Difference]: Finished difference Result 416 states and 673 transitions. [2024-11-12 03:44:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:44:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-12 03:44:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:15,650 INFO L225 Difference]: With dead ends: 416 [2024-11-12 03:44:15,652 INFO L226 Difference]: Without dead ends: 314 [2024-11-12 03:44:15,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:44:15,656 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 159 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:15,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 524 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 03:44:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-12 03:44:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2024-11-12 03:44:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 158 states have (on average 1.4050632911392404) internal successors, (222), 158 states have internal predecessors, (222), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-12 03:44:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 396 transitions. [2024-11-12 03:44:15,707 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 396 transitions. Word has length 191 [2024-11-12 03:44:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:15,708 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 396 transitions. [2024-11-12 03:44:15,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 396 transitions. [2024-11-12 03:44:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:44:15,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:15,712 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:15,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 03:44:15,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:15,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:15,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1536884899, now seen corresponding path program 1 times [2024-11-12 03:44:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:15,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234777056] [2024-11-12 03:44:15,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:15,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:15,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:15,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 03:44:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:16,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:44:16,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:44:16,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:44:16,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:16,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234777056] [2024-11-12 03:44:16,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234777056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:44:16,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:44:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:44:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658741510] [2024-11-12 03:44:16,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:44:16,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:44:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:44:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:44:16,239 INFO L87 Difference]: Start difference. First operand 249 states and 396 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:16,411 INFO L93 Difference]: Finished difference Result 420 states and 669 transitions. [2024-11-12 03:44:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:44:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-12 03:44:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:16,423 INFO L225 Difference]: With dead ends: 420 [2024-11-12 03:44:16,424 INFO L226 Difference]: Without dead ends: 249 [2024-11-12 03:44:16,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:44:16,427 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:16,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:44:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-12 03:44:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-11-12 03:44:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 158 states have (on average 1.379746835443038) internal successors, (218), 158 states have internal predecessors, (218), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-12 03:44:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 392 transitions. [2024-11-12 03:44:16,479 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 392 transitions. Word has length 191 [2024-11-12 03:44:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:16,479 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 392 transitions. [2024-11-12 03:44:16,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 392 transitions. [2024-11-12 03:44:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:44:16,483 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:16,483 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:16,499 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-12 03:44:16,684 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 [2024-11-12 03:44:16,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:16,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash -835820321, now seen corresponding path program 1 times [2024-11-12 03:44:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101904467] [2024-11-12 03:44:16,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:16,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:16,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:16,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 03:44:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:17,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 03:44:17,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-12 03:44:17,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:44:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-12 03:44:18,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101904467] [2024-11-12 03:44:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101904467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:44:18,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:44:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-12 03:44:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909611853] [2024-11-12 03:44:18,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:44:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 03:44:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 03:44:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:44:18,047 INFO L87 Difference]: Start difference. First operand 249 states and 392 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-12 03:44:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:19,244 INFO L93 Difference]: Finished difference Result 493 states and 738 transitions. [2024-11-12 03:44:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 03:44:19,245 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 191 [2024-11-12 03:44:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:19,249 INFO L225 Difference]: With dead ends: 493 [2024-11-12 03:44:19,249 INFO L226 Difference]: Without dead ends: 410 [2024-11-12 03:44:19,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 03:44:19,251 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 220 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:19,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 483 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 03:44:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-12 03:44:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 384. [2024-11-12 03:44:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 255 states have (on average 1.3568627450980393) internal successors, (346), 255 states have internal predecessors, (346), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-12 03:44:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 578 transitions. [2024-11-12 03:44:19,301 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 578 transitions. Word has length 191 [2024-11-12 03:44:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:19,303 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 578 transitions. [2024-11-12 03:44:19,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-12 03:44:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 578 transitions. [2024-11-12 03:44:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:44:19,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:19,308 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:19,324 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 (6)] Ended with exit code 0 [2024-11-12 03:44:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:19,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:19,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1770203233, now seen corresponding path program 1 times [2024-11-12 03:44:19,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:19,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228334238] [2024-11-12 03:44:19,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:19,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:19,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:19,514 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-12 03:44:19,515 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-12 03:44:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:19,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:44:19,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-12 03:44:20,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:44:20,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:20,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228334238] [2024-11-12 03:44:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228334238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:44:20,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [621642607] [2024-11-12 03:44:20,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:20,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:44:20,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:44:20,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-12 03:44:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:21,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 03:44:21,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:44:22,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:44:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [621642607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:44:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:44:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-12 03:44:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288559174] [2024-11-12 03:44:22,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:44:22,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:44:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:44:22,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-12 03:44:22,085 INFO L87 Difference]: Start difference. First operand 384 states and 578 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:23,723 INFO L93 Difference]: Finished difference Result 1014 states and 1507 transitions. [2024-11-12 03:44:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:44:23,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-12 03:44:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:23,747 INFO L225 Difference]: With dead ends: 1014 [2024-11-12 03:44:23,747 INFO L226 Difference]: Without dead ends: 822 [2024-11-12 03:44:23,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-12 03:44:23,749 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 183 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:23,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 590 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 03:44:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-12 03:44:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 732. [2024-11-12 03:44:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 501 states have (on average 1.3552894211576847) internal successors, (679), 503 states have internal predecessors, (679), 207 states have call successors, (207), 23 states have call predecessors, (207), 23 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-12 03:44:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1093 transitions. [2024-11-12 03:44:23,840 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1093 transitions. Word has length 191 [2024-11-12 03:44:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:23,842 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1093 transitions. [2024-11-12 03:44:23,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1093 transitions. [2024-11-12 03:44:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:44:23,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:23,845 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:23,857 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-12 03:44:24,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-12 03:44:24,245 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:24,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:24,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -223941473, now seen corresponding path program 1 times [2024-11-12 03:44:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988045575] [2024-11-12 03:44:24,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:24,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:24,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:24,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:24,250 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 (9)] Waiting until timeout for monitored process [2024-11-12 03:44:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:24,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:44:24,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-12 03:44:25,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:44:25,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988045575] [2024-11-12 03:44:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988045575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:44:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [178272128] [2024-11-12 03:44:25,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:44:25,634 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:44:25,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-12 03:44:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:26,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 03:44:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 03:44:26,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:44:26,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [178272128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:44:26,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 03:44:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-12 03:44:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699031622] [2024-11-12 03:44:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:44:26,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:44:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:44:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:44:26,987 INFO L87 Difference]: Start difference. First operand 732 states and 1093 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:28,626 INFO L93 Difference]: Finished difference Result 1240 states and 1852 transitions. [2024-11-12 03:44:28,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:44:28,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-12 03:44:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:28,637 INFO L225 Difference]: With dead ends: 1240 [2024-11-12 03:44:28,637 INFO L226 Difference]: Without dead ends: 960 [2024-11-12 03:44:28,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:44:28,640 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 109 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:28,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 514 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 03:44:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-12 03:44:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 907. [2024-11-12 03:44:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 612 states have (on average 1.3480392156862746) internal successors, (825), 614 states have internal predecessors, (825), 265 states have call successors, (265), 29 states have call predecessors, (265), 29 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-11-12 03:44:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1355 transitions. [2024-11-12 03:44:28,736 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1355 transitions. Word has length 191 [2024-11-12 03:44:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:28,737 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1355 transitions. [2024-11-12 03:44:28,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 03:44:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1355 transitions. [2024-11-12 03:44:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 03:44:28,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:28,741 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:28,759 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 (9)] Ended with exit code 0 [2024-11-12 03:44:28,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-12 03:44:29,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:29,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 22181785, now seen corresponding path program 1 times [2024-11-12 03:44:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:29,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999893530] [2024-11-12 03:44:29,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:29,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:29,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:29,147 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 (11)] Waiting until timeout for monitored process [2024-11-12 03:44:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:29,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:44:29,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-12 03:44:29,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:44:30,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:44:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999893530] [2024-11-12 03:44:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999893530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:44:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [593253511] [2024-11-12 03:44:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:30,181 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:30,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:44:30,183 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:44:30,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-12 03:44:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:31,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:44:31,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:44:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-12 03:44:31,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:44:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [593253511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:44:31,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:44:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-12 03:44:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257048879] [2024-11-12 03:44:31,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:44:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:44:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:44:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:44:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:44:31,717 INFO L87 Difference]: Start difference. First operand 907 states and 1355 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:44:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:44:32,594 INFO L93 Difference]: Finished difference Result 1621 states and 2358 transitions. [2024-11-12 03:44:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 03:44:32,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-12 03:44:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:44:32,601 INFO L225 Difference]: With dead ends: 1621 [2024-11-12 03:44:32,602 INFO L226 Difference]: Without dead ends: 1200 [2024-11-12 03:44:32,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2024-11-12 03:44:32,604 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 154 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:44:32,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 385 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:44:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-12 03:44:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1128. [2024-11-12 03:44:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 758 states have (on average 1.3205804749340369) internal successors, (1001), 760 states have internal predecessors, (1001), 323 states have call successors, (323), 46 states have call predecessors, (323), 46 states have return successors, (323), 321 states have call predecessors, (323), 323 states have call successors, (323) [2024-11-12 03:44:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1647 transitions. [2024-11-12 03:44:32,748 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1647 transitions. Word has length 192 [2024-11-12 03:44:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:44:32,749 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1647 transitions. [2024-11-12 03:44:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 03:44:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1647 transitions. [2024-11-12 03:44:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 03:44:32,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:44:32,754 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:44:32,768 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 (11)] Ended with exit code 0 [2024-11-12 03:44:32,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-12 03:44:33,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 03:44:33,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:44:33,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:44:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash -370845225, now seen corresponding path program 1 times [2024-11-12 03:44:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:44:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890857092] [2024-11-12 03:44:33,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:44:33,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:44:33,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:44:33,158 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:44:33,159 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 (13)] Waiting until timeout for monitored process [2024-11-12 03:44:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:44:33,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 03:44:33,394 INFO L279 TraceCheckSpWp]: Computing forward predicates...