./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:11:48,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:11:48,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:11:48,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:11:48,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:11:48,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:11:48,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:11:48,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:11:48,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:11:48,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:11:48,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:11:48,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:11:48,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:11:49,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:11:49,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:11:49,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:11:49,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:11:49,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:11:49,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:11:49,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:11:49,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:11:49,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:11:49,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:11:49,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:11:49,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:11:49,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:11:49,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:11:49,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:11:49,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:11:49,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:11:49,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:11:49,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:11:49,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:11:49,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:11:49,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:11:49,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:11:49,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:11:49,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:11:49,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:11:49,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:11:49,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:11:49,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:11:49,028 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-20 09:11:49,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:11:49,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:11:49,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:11:49,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:11:49,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:11:49,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-20 09:11:51,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:11:51,375 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:11:51,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-20 09:11:51,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7b3628e/1edc6a09ceaa4416ab4ae1c6f03a1f76/FLAGf96886ab8 [2024-11-20 09:11:51,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7b3628e/1edc6a09ceaa4416ab4ae1c6f03a1f76 [2024-11-20 09:11:51,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:11:51,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:11:51,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:11:51,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:11:51,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:11:51,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:51,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506fd54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51, skipping insertion in model container [2024-11-20 09:11:51,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:51,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:11:51,701 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-11-20 09:11:51,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:11:51,819 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:11:51,836 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-11-20 09:11:51,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:11:51,939 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:11:51,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51 WrapperNode [2024-11-20 09:11:51,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:11:51,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:11:51,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:11:51,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:11:51,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:51,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,031 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-11-20 09:11:52,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:11:52,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:11:52,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:11:52,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:11:52,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,073 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:11:52,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:11:52,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:11:52,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:11:52,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:11:52,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (1/1) ... [2024-11-20 09:11:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:11:52,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:11:52,189 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-20 09:11:52,201 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-20 09:11:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:11:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:11:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:11:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:11:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:11:52,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:11:52,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:11:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:11:52,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:11:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:11:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:11:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:11:52,368 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:11:52,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:11:52,836 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-20 09:11:52,837 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:11:52,853 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:11:52,853 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:11:52,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:52 BoogieIcfgContainer [2024-11-20 09:11:52,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:11:52,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:11:52,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:11:52,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:11:52,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:11:51" (1/3) ... [2024-11-20 09:11:52,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43afd722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:52, skipping insertion in model container [2024-11-20 09:11:52,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:51" (2/3) ... [2024-11-20 09:11:52,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43afd722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:52, skipping insertion in model container [2024-11-20 09:11:52,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:52" (3/3) ... [2024-11-20 09:11:52,863 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-20 09:11:52,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:11:52,878 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:11:52,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:11:52,951 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;@3e46519a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:11:52,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:11:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:11:52,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:52,982 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:52,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1431925537, now seen corresponding path program 1 times [2024-11-20 09:11:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702056649] [2024-11-20 09:11:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702056649] [2024-11-20 09:11:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702056649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:11:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578641613] [2024-11-20 09:11:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:53,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:11:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:11:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:11:53,522 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:11:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:53,543 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-20 09:11:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:11:53,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-20 09:11:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:53,556 INFO L225 Difference]: With dead ends: 193 [2024-11-20 09:11:53,556 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 09:11:53,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-20 09:11:53,561 INFO L432 NwaCegarLoop]: 138 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, 138 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-20 09:11:53,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 09:11:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 09:11:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-20 09:11:53,595 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-20 09:11:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:53,595 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-20 09:11:53,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:11:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-20 09:11:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:11:53,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:53,598 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:53,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:11:53,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:53,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2107248781, now seen corresponding path program 1 times [2024-11-20 09:11:53,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:53,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474990925] [2024-11-20 09:11:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474990925] [2024-11-20 09:11:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474990925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452005133] [2024-11-20 09:11:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:53,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:53,935 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:11:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:53,991 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-20 09:11:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-20 09:11:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:53,995 INFO L225 Difference]: With dead ends: 191 [2024-11-20 09:11:53,995 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 09:11:53,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:53,999 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:53,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 09:11:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-20 09:11:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-20 09:11:54,020 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-20 09:11:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:54,021 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-20 09:11:54,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:11:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-20 09:11:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:11:54,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:54,023 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:54,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:11:54,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:54,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash 568908751, now seen corresponding path program 1 times [2024-11-20 09:11:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914910721] [2024-11-20 09:11:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914910721] [2024-11-20 09:11:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914910721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:54,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265030454] [2024-11-20 09:11:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:54,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:54,262 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:54,299 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-20 09:11:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:54,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:11:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:54,301 INFO L225 Difference]: With dead ends: 196 [2024-11-20 09:11:54,301 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 09:11:54,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:54,302 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:54,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 09:11:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-20 09:11:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-20 09:11:54,317 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-20 09:11:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:54,318 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-20 09:11:54,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-20 09:11:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:11:54,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:54,322 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:54,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:11:54,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1248967121, now seen corresponding path program 1 times [2024-11-20 09:11:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650933966] [2024-11-20 09:11:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650933966] [2024-11-20 09:11:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650933966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067063985] [2024-11-20 09:11:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:54,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:54,556 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:54,591 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-20 09:11:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:11:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:54,597 INFO L225 Difference]: With dead ends: 200 [2024-11-20 09:11:54,598 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 09:11:54,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:54,599 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:54,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 09:11:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-20 09:11:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-20 09:11:54,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-20 09:11:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:54,613 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-20 09:11:54,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-20 09:11:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:11:54,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:54,618 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:11:54,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1270992813, now seen corresponding path program 1 times [2024-11-20 09:11:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101535161] [2024-11-20 09:11:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:55,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101535161] [2024-11-20 09:11:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101535161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:55,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:11:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533177349] [2024-11-20 09:11:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:11:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:55,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:11:55,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:55,549 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:55,802 INFO L93 Difference]: Finished difference Result 203 states and 287 transitions. [2024-11-20 09:11:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:11:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:11:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:55,804 INFO L225 Difference]: With dead ends: 203 [2024-11-20 09:11:55,804 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 09:11:55,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-20 09:11:55,809 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 96 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:55,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 304 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:11:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 09:11:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-20 09:11:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-20 09:11:55,822 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2024-11-20 09:11:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:55,823 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-20 09:11:55,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-20 09:11:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:11:55,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:55,825 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:55,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:11:55,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:55,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1335030741, now seen corresponding path program 1 times [2024-11-20 09:11:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178634477] [2024-11-20 09:11:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178634477] [2024-11-20 09:11:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178634477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:11:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015402539] [2024-11-20 09:11:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:11:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:11:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:56,565 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:56,745 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2024-11-20 09:11:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:11:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:11:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:56,747 INFO L225 Difference]: With dead ends: 237 [2024-11-20 09:11:56,747 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 09:11:56,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:11:56,748 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 147 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:56,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 478 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:11:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 09:11:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-11-20 09:11:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:11:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-20 09:11:56,756 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 123 [2024-11-20 09:11:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:56,756 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-20 09:11:56,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:11:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-20 09:11:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:11:56,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:56,757 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:11:56,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:11:56,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:56,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash 375638192, now seen corresponding path program 1 times [2024-11-20 09:11:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103860578] [2024-11-20 09:11:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:11:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:11:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:11:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:11:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:11:58,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:58,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103860578] [2024-11-20 09:11:58,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103860578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:58,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:11:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159027316] [2024-11-20 09:11:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:11:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:11:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:11:58,921 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:00,155 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2024-11-20 09:12:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:12:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-20 09:12:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:00,157 INFO L225 Difference]: With dead ends: 241 [2024-11-20 09:12:00,157 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 09:12:00,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:12:00,158 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 264 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:00,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 584 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:12:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 09:12:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-11-20 09:12:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:12:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-20 09:12:00,173 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 125 [2024-11-20 09:12:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:00,173 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-20 09:12:00,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-20 09:12:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:12:00,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:00,175 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:00,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:12:00,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:00,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665936, now seen corresponding path program 1 times [2024-11-20 09:12:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591128114] [2024-11-20 09:12:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:12:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:01,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591128114] [2024-11-20 09:12:01,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591128114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:01,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:01,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:12:01,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229377317] [2024-11-20 09:12:01,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:01,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:12:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:01,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:12:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:12:01,879 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:02,945 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2024-11-20 09:12:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 09:12:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-20 09:12:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:02,946 INFO L225 Difference]: With dead ends: 237 [2024-11-20 09:12:02,946 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 09:12:02,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:12:02,947 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 328 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:02,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 391 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:12:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 09:12:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2024-11-20 09:12:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:12:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-20 09:12:02,956 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 125 [2024-11-20 09:12:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:02,957 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-20 09:12:02,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-20 09:12:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:12:02,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:02,958 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:02,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:12:02,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:02,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1444028551, now seen corresponding path program 1 times [2024-11-20 09:12:02,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:02,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128003293] [2024-11-20 09:12:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-20 09:12:05,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128003293] [2024-11-20 09:12:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128003293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:05,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 09:12:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301621840] [2024-11-20 09:12:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:05,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 09:12:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 09:12:05,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:12:05,667 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:07,615 INFO L93 Difference]: Finished difference Result 268 states and 372 transitions. [2024-11-20 09:12:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 09:12:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-20 09:12:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:07,616 INFO L225 Difference]: With dead ends: 268 [2024-11-20 09:12:07,617 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 09:12:07,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 09:12:07,618 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 374 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:07,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 564 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 09:12:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 09:12:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2024-11-20 09:12:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 132 states have internal predecessors, (171), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:12:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2024-11-20 09:12:07,638 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 125 [2024-11-20 09:12:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:07,638 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2024-11-20 09:12:07,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2024-11-20 09:12:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:12:07,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:07,640 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:07,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:12:07,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:07,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1780572309, now seen corresponding path program 1 times [2024-11-20 09:12:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123348459] [2024-11-20 09:12:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:12:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123348459] [2024-11-20 09:12:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123348459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:12:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337443619] [2024-11-20 09:12:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:08,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:12:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:12:08,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:12:08,209 INFO L87 Difference]: Start difference. First operand 160 states and 223 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:12:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:08,388 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2024-11-20 09:12:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:12:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-20 09:12:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:08,392 INFO L225 Difference]: With dead ends: 307 [2024-11-20 09:12:08,392 INFO L226 Difference]: Without dead ends: 201 [2024-11-20 09:12:08,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:12:08,393 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 43 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:08,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 813 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:12:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-20 09:12:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 165. [2024-11-20 09:12:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 137 states have internal predecessors, (177), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:12:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-11-20 09:12:08,409 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 127 [2024-11-20 09:12:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-11-20 09:12:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:12:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-11-20 09:12:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:12:08,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:08,410 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:08,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:12:08,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:08,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash -696788308, now seen corresponding path program 1 times [2024-11-20 09:12:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933950896] [2024-11-20 09:12:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:12:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933950896] [2024-11-20 09:12:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933950896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:25,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-20 09:12:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430702937] [2024-11-20 09:12:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:25,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 09:12:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 09:12:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:12:25,929 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:47,687 INFO L93 Difference]: Finished difference Result 297 states and 406 transitions. [2024-11-20 09:12:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 09:12:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-20 09:12:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:47,689 INFO L225 Difference]: With dead ends: 297 [2024-11-20 09:12:47,689 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 09:12:47,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-20 09:12:47,690 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 355 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:47,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 833 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-20 09:12:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 09:12:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2024-11-20 09:12:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 134 states have internal predecessors, (172), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:12:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2024-11-20 09:12:47,716 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 127 [2024-11-20 09:12:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:47,717 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2024-11-20 09:12:47,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2024-11-20 09:12:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:12:47,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:47,718 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:47,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:12:47,719 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:47,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1711105474, now seen corresponding path program 1 times [2024-11-20 09:12:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:47,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226779408] [2024-11-20 09:12:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:12:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226779408] [2024-11-20 09:12:48,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226779408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 09:12:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111711349] [2024-11-20 09:12:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:48,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:12:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:12:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:12:48,590 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:12:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:49,048 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2024-11-20 09:12:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:12:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-20 09:12:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:49,050 INFO L225 Difference]: With dead ends: 270 [2024-11-20 09:12:49,050 INFO L226 Difference]: Without dead ends: 162 [2024-11-20 09:12:49,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:12:49,051 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 165 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:49,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 405 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:12:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-20 09:12:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-20 09:12:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.2857142857142858) internal successors, (171), 134 states have internal predecessors, (171), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:12:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 223 transitions. [2024-11-20 09:12:49,065 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 223 transitions. Word has length 127 [2024-11-20 09:12:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:49,068 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 223 transitions. [2024-11-20 09:12:49,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:12:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 223 transitions. [2024-11-20 09:12:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:12:49,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:49,069 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:12:49,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1452940036, now seen corresponding path program 1 times [2024-11-20 09:12:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:49,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507666023] [2024-11-20 09:12:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:12:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507666023] [2024-11-20 09:12:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507666023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:12:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080140067] [2024-11-20 09:12:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:12:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:12:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:12:50,988 INFO L87 Difference]: Start difference. First operand 162 states and 223 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:52,215 INFO L93 Difference]: Finished difference Result 272 states and 372 transitions. [2024-11-20 09:12:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:12:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-20 09:12:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:52,219 INFO L225 Difference]: With dead ends: 272 [2024-11-20 09:12:52,219 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 09:12:52,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:12:52,221 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:52,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 467 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:12:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 09:12:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-20 09:12:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.2814814814814814) internal successors, (173), 136 states have internal predecessors, (173), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:12:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 225 transitions. [2024-11-20 09:12:52,245 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 225 transitions. Word has length 127 [2024-11-20 09:12:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:52,245 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 225 transitions. [2024-11-20 09:12:52,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:12:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2024-11-20 09:12:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:12:52,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:52,248 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:52,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:12:52,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:52,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1454787078, now seen corresponding path program 1 times [2024-11-20 09:12:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:52,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372965218] [2024-11-20 09:12:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:52,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:12:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:12:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:12:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:12:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:12:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:12:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:12:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:12:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372965218] [2024-11-20 09:12:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372965218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:12:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975844971] [2024-11-20 09:12:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:12:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:12:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:12:53,319 INFO L87 Difference]: Start difference. First operand 164 states and 225 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:12:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:53,731 INFO L93 Difference]: Finished difference Result 169 states and 230 transitions. [2024-11-20 09:12:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:12:53,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-20 09:12:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:53,732 INFO L225 Difference]: With dead ends: 169 [2024-11-20 09:12:53,732 INFO L226 Difference]: Without dead ends: 167 [2024-11-20 09:12:53,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:12:53,733 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 167 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:53,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 483 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:12:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-20 09:12:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-20 09:12:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 139 states have internal predecessors, (176), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:12:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 228 transitions. [2024-11-20 09:12:53,770 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 228 transitions. Word has length 127 [2024-11-20 09:12:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:53,770 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 228 transitions. [2024-11-20 09:12:53,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:12:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2024-11-20 09:12:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:12:53,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:53,771 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:12:53,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:12:53,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:53,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:53,772 INFO L85 PathProgramCache]: Analyzing trace with hash 322067326, now seen corresponding path program 1 times [2024-11-20 09:12:53,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:53,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94452867] [2024-11-20 09:12:53,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:12:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986854897] [2024-11-20 09:12:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:12:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:12:53,918 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-20 09:12:53,924 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-20 09:12:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:12:55,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:12:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:12:56,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:12:56,725 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:12:56,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:12:56,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 09:12:56,927 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,SelfDestructingSolverStorable14 [2024-11-20 09:12:56,931 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:57,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:12:57,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:12:57 BoogieIcfgContainer [2024-11-20 09:12:57,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:12:57,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:12:57,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:12:57,071 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:12:57,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:52" (3/4) ... [2024-11-20 09:12:57,073 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:12:57,074 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:12:57,075 INFO L158 Benchmark]: Toolchain (without parser) took 65669.21ms. Allocated memory was 130.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 61.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2024-11-20 09:12:57,075 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:12:57,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.71ms. Allocated memory was 130.0MB in the beginning and 211.8MB in the end (delta: 81.8MB). Free memory was 60.9MB in the beginning and 175.6MB in the end (delta: -114.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-20 09:12:57,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.13ms. Allocated memory is still 211.8MB. Free memory was 175.6MB in the beginning and 172.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:12:57,077 INFO L158 Benchmark]: Boogie Preprocessor took 90.59ms. Allocated memory is still 211.8MB. Free memory was 172.4MB in the beginning and 168.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:12:57,077 INFO L158 Benchmark]: RCFGBuilder took 730.49ms. Allocated memory is still 211.8MB. Free memory was 168.2MB in the beginning and 133.7MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-20 09:12:57,077 INFO L158 Benchmark]: TraceAbstraction took 64213.75ms. Allocated memory was 211.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2024-11-20 09:12:57,078 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:12:57,079 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.12ms. Allocated memory is still 130.0MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.71ms. Allocated memory was 130.0MB in the beginning and 211.8MB in the end (delta: 81.8MB). Free memory was 60.9MB in the beginning and 175.6MB in the end (delta: -114.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.13ms. Allocated memory is still 211.8MB. Free memory was 175.6MB in the beginning and 172.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.59ms. Allocated memory is still 211.8MB. Free memory was 172.4MB in the beginning and 168.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 730.49ms. Allocated memory is still 211.8MB. Free memory was 168.2MB in the beginning and 133.7MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 64213.75ms. Allocated memory was 211.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L57] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L65] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L66] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L67] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] signed long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L70] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L71] unsigned char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L105] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L108] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L116] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L118] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L122] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L137] RET updateVariables() [L138] CALL step() [L75] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L75] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L76] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_20_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L77] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L78] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_19_Pointer)); [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))); [L80] COND FALSE !(stepLocal_0 >= 1u) [L87] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L87] (*(WrapperStruct00_var_1_8_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L89] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_8_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=515, stepLocal_2=3] [L90] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L93] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) [L95] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=515] [L95] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) [L98] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L98] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) [L129] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129-L130] return (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.0s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2080 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2079 mSDsluCounter, 6646 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5065 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4577 IncrementalHoareTripleChecker+Invalid, 4761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 1581 mSDtfsCounter, 4577 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=14, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 161 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 2002 NumberOfCodeBlocks, 2002 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1734 ConstructedInterpolants, 0 QuantifiedInterpolants, 23269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 5096/5096 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-20 09:12:57,225 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:12:59,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:12:59,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:12:59,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:12:59,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:13:00,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:13:00,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:13:00,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:13:00,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:13:00,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:13:00,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:13:00,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:13:00,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:13:00,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:13:00,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:13:00,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:13:00,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:13:00,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:13:00,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:13:00,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:13:00,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:13:00,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:13:00,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:13:00,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:13:00,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:13:00,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:13:00,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:13:00,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:13:00,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:13:00,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:13:00,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:13:00,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:13:00,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:13:00,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:13:00,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:13:00,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:13:00,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:13:00,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:13:00,042 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-20 09:13:00,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:13:00,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:13:00,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:13:00,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:13:00,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:13:00,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-20 09:13:01,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:13:01,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:13:01,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-20 09:13:01,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6b3a1de/7f2366fb276f4489ba1c9770a279f336/FLAGfb413c6fc [2024-11-20 09:13:02,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6b3a1de/7f2366fb276f4489ba1c9770a279f336 [2024-11-20 09:13:02,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:13:02,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:13:02,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:13:02,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:13:02,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:13:02,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159d5c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02, skipping insertion in model container [2024-11-20 09:13:02,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:13:02,570 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-11-20 09:13:02,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:13:02,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:13:02,680 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-11-20 09:13:02,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:13:02,783 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:13:02,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02 WrapperNode [2024-11-20 09:13:02,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:13:02,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:13:02,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:13:02,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:13:02,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,863 INFO L138 Inliner]: procedures = 34, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-20 09:13:02,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:13:02,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:13:02,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:13:02,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:13:02,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,924 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-20 09:13:02,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:13:02,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:13:02,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:13:02,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:13:02,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (1/1) ... [2024-11-20 09:13:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:13:03,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:13:03,017 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-20 09:13:03,029 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-20 09:13:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:13:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:13:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:13:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:13:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:13:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 09:13:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 09:13:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:13:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:13:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:13:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:13:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-20 09:13:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-20 09:13:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:13:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:13:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:13:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:13:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:13:03,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:13:03,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:13:03,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:13:05,251 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-20 09:13:05,252 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:13:05,267 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:13:05,268 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:13:05,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:13:05 BoogieIcfgContainer [2024-11-20 09:13:05,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:13:05,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:13:05,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:13:05,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:13:05,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:13:02" (1/3) ... [2024-11-20 09:13:05,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6bc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:13:05, skipping insertion in model container [2024-11-20 09:13:05,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:02" (2/3) ... [2024-11-20 09:13:05,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6bc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:13:05, skipping insertion in model container [2024-11-20 09:13:05,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:13:05" (3/3) ... [2024-11-20 09:13:05,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-20 09:13:05,289 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:13:05,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:13:05,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:13:05,349 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;@26ae6381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:13:05,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:13:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:13:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:13:05,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:05,366 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:13:05,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 519972969, now seen corresponding path program 1 times [2024-11-20 09:13:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:13:05,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202287268] [2024-11-20 09:13:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:05,401 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-20 09:13:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:13:05,404 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-20 09:13:05,520 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-20 09:13:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:06,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:13:06,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:13:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-20 09:13:06,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:13:06,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:13:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202287268] [2024-11-20 09:13:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202287268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:06,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:13:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829989037] [2024-11-20 09:13:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:06,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:13:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:13:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:13:06,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:13:06,196 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:13:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:06,235 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-20 09:13:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:13:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-20 09:13:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:06,245 INFO L225 Difference]: With dead ends: 193 [2024-11-20 09:13:06,248 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 09:13:06,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-20 09:13:06,256 INFO L432 NwaCegarLoop]: 138 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, 138 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-20 09:13:06,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:13:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 09:13:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 09:13:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:13:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-20 09:13:06,313 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-20 09:13:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-20 09:13:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:13:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-20 09:13:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:13:06,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:06,318 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:13:06,332 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-20 09:13:06,520 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-20 09:13:06,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1195296213, now seen corresponding path program 1 times [2024-11-20 09:13:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:13:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234654017] [2024-11-20 09:13:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:06,525 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-20 09:13:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:13:06,530 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-20 09:13:06,532 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-20 09:13:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 09:13:07,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:13:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:13:07,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:13:07,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:13:07,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234654017] [2024-11-20 09:13:07,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234654017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:07,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:13:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828992482] [2024-11-20 09:13:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:07,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:13:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:13:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:13:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:13:07,190 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:13:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:07,332 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-20 09:13:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:13:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:13:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:07,338 INFO L225 Difference]: With dead ends: 194 [2024-11-20 09:13:07,338 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 09:13:07,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:13:07,342 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:07,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:13:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 09:13:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-20 09:13:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:13:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-20 09:13:07,361 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-20 09:13:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:07,366 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-20 09:13:07,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:13:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-20 09:13:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:13:07,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:07,368 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:13:07,393 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-20 09:13:07,574 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-20 09:13:07,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:07,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1875354583, now seen corresponding path program 1 times [2024-11-20 09:13:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:13:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513068717] [2024-11-20 09:13:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:07,578 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-20 09:13:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:13:07,582 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-20 09:13:07,583 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-20 09:13:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 09:13:08,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:13:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:13:08,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:13:08,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:13:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513068717] [2024-11-20 09:13:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513068717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:08,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:08,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:13:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570821504] [2024-11-20 09:13:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:13:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:13:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:13:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:13:08,186 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:13:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:08,313 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-20 09:13:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:13:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:13:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:08,319 INFO L225 Difference]: With dead ends: 200 [2024-11-20 09:13:08,319 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 09:13:08,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:13:08,320 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:08,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:13:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 09:13:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-20 09:13:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:13:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-20 09:13:08,339 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-20 09:13:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:08,340 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-20 09:13:08,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:13:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-20 09:13:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:13:08,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:08,349 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:13:08,370 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-20 09:13:08,549 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-20 09:13:08,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:08,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash -644605351, now seen corresponding path program 1 times [2024-11-20 09:13:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:13:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576091975] [2024-11-20 09:13:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:08,554 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-20 09:13:08,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:13:08,560 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-20 09:13:08,561 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-20 09:13:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 09:13:08,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:13:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:13:08,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:13:08,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:13:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576091975] [2024-11-20 09:13:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576091975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:13:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946220295] [2024-11-20 09:13:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:08,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:13:08,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:13:08,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:13:08,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:13:08,951 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:13:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:09,009 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2024-11-20 09:13:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:13:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-20 09:13:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:09,010 INFO L225 Difference]: With dead ends: 204 [2024-11-20 09:13:09,010 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 09:13:09,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:13:09,012 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:09,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:13:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 09:13:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-20 09:13:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:13:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-20 09:13:09,027 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 123 [2024-11-20 09:13:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:09,028 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-20 09:13:09,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:13:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-20 09:13:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:13:09,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:09,030 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:13:09,042 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-20 09:13:09,233 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-20 09:13:09,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash -642758309, now seen corresponding path program 1 times [2024-11-20 09:13:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:13:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314538932] [2024-11-20 09:13:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:09,236 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-20 09:13:09,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:13:09,238 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-20 09:13:09,239 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-20 09:13:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:09,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 09:13:09,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:13:09,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2024-11-20 09:13:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-20 09:13:09,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:13:09,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:13:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314538932] [2024-11-20 09:13:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314538932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:09,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:13:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620827287] [2024-11-20 09:13:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:13:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:13:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:13:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:13:09,835 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)