./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.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 be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:27:30,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:27:30,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:27:30,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:27:30,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:27:30,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:27:30,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:27:30,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:27:30,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:27:30,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:27:30,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:27:30,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:27:30,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:27:30,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:27:30,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:27:30,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:27:30,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:27:30,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:27:30,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:27:30,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:27:30,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:27:30,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:27:30,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:27:30,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:27:30,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:27:30,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:27:30,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:27:30,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:27:30,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:27:30,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:27:30,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:27:30,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:27:30,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:30,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:27:30,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:27:30,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:27:30,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:27:30,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:27:30,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:27:30,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:27:30,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:27:30,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:27:30,173 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 -> be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 [2024-11-10 05:27:30,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:27:30,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:27:30,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:27:30,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:27:30,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:27:30,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-10 05:27:31,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:27:32,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:27:32,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-10 05:27:32,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de317a6d6/5ef5c59f49774620bf556e16e697f4d5/FLAG80b3da2cb [2024-11-10 05:27:32,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de317a6d6/5ef5c59f49774620bf556e16e697f4d5 [2024-11-10 05:27:32,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:27:32,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:27:32,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:32,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:27:32,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:27:32,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e6622e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32, skipping insertion in model container [2024-11-10 05:27:32,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:27:32,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-10 05:27:32,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:32,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:27:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-10 05:27:32,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:32,737 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:27:32,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32 WrapperNode [2024-11-10 05:27:32,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:32,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:32,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:27:32,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:27:32,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,806 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-11-10 05:27:32,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:32,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:27:32,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:27:32,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:27:32,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,859 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:27:32,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:27:32,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:27:32,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:27:32,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:27:32,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (1/1) ... [2024-11-10 05:27:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:32,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:32,942 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-10 05:27:32,946 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-10 05:27:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:27:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:27:33,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:27:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:27:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:27:33,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:27:33,107 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:27:33,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:27:33,584 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-10 05:27:33,639 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 05:27:33,639 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:27:33,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:27:33,671 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:27:33,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:33 BoogieIcfgContainer [2024-11-10 05:27:33,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:27:33,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:27:33,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:27:33,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:27:33,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:32" (1/3) ... [2024-11-10 05:27:33,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6252863b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:33, skipping insertion in model container [2024-11-10 05:27:33,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:32" (2/3) ... [2024-11-10 05:27:33,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6252863b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:33, skipping insertion in model container [2024-11-10 05:27:33,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:33" (3/3) ... [2024-11-10 05:27:33,683 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-10 05:27:33,700 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:27:33,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:27:33,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:27:33,793 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;@4b44ed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:27:33,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:27:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:27:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 05:27:33,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:33,816 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:33,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:33,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash -643720172, now seen corresponding path program 1 times [2024-11-10 05:27:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:33,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619529824] [2024-11-10 05:27:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:27:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:27:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:27:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:27:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:27:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:27:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:27:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:27:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:27:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:27:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:27:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:27:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:27:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:27:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:27:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:27:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:27:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:27:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:27:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:27:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:27:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:27:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:27:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:27:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:27:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:27:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:27:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:27:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:27:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:27:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619529824] [2024-11-10 05:27:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619529824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:34,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:27:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574079461] [2024-11-10 05:27:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:34,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:27:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:34,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:27:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:34,473 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 05:27:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:34,554 INFO L93 Difference]: Finished difference Result 202 states and 351 transitions. [2024-11-10 05:27:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:27:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 199 [2024-11-10 05:27:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:34,569 INFO L225 Difference]: With dead ends: 202 [2024-11-10 05:27:34,569 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 05:27:34,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:34,581 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:34,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 05:27:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 05:27:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:27:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-10 05:27:34,694 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 199 [2024-11-10 05:27:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:34,694 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-10 05:27:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 05:27:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-10 05:27:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 05:27:34,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:34,701 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:27:34,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1120050764, now seen corresponding path program 1 times [2024-11-10 05:27:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110794727] [2024-11-10 05:27:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:27:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:27:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:27:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:27:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:27:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:27:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:27:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:27:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:27:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:27:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:27:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:27:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:27:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:27:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:27:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:27:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:27:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:27:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:27:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:27:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:27:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:27:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:27:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:27:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:27:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:27:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:27:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:27:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:27:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:27:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:35,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110794727] [2024-11-10 05:27:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110794727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:35,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:35,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544581680] [2024-11-10 05:27:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:35,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:35,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:35,165 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:27:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:35,206 INFO L93 Difference]: Finished difference Result 198 states and 311 transitions. [2024-11-10 05:27:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:35,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-10 05:27:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:35,212 INFO L225 Difference]: With dead ends: 198 [2024-11-10 05:27:35,215 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 05:27:35,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:35,217 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:35,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 05:27:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 05:27:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:27:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2024-11-10 05:27:35,241 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 199 [2024-11-10 05:27:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2024-11-10 05:27:35,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:27:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2024-11-10 05:27:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 05:27:35,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:35,250 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:35,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:27:35,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:35,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash 622759571, now seen corresponding path program 1 times [2024-11-10 05:27:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531240834] [2024-11-10 05:27:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:27:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:27:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:27:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:27:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:27:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:27:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:27:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:27:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:27:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:27:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:27:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:27:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:27:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:27:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:27:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:27:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:27:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:27:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:27:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:27:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:27:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:27:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:27:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:27:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:27:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:27:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:27:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:27:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:27:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:27:36,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531240834] [2024-11-10 05:27:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531240834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:36,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:36,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:27:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807788359] [2024-11-10 05:27:36,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:36,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:27:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:27:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:27:36,928 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:27:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:38,321 INFO L93 Difference]: Finished difference Result 553 states and 835 transitions. [2024-11-10 05:27:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:27:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-10 05:27:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:38,329 INFO L225 Difference]: With dead ends: 553 [2024-11-10 05:27:38,330 INFO L226 Difference]: Without dead ends: 455 [2024-11-10 05:27:38,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:27:38,332 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 672 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:38,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 791 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 05:27:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-10 05:27:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 410. [2024-11-10 05:27:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 287 states have (on average 1.3937282229965158) internal successors, (400), 290 states have internal predecessors, (400), 116 states have call successors, (116), 6 states have call predecessors, (116), 6 states have return successors, (116), 113 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-10 05:27:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 632 transitions. [2024-11-10 05:27:38,433 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 632 transitions. Word has length 199 [2024-11-10 05:27:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:38,434 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 632 transitions. [2024-11-10 05:27:38,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:27:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 632 transitions. [2024-11-10 05:27:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 05:27:38,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:38,440 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:27:38,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:38,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1174191788, now seen corresponding path program 1 times [2024-11-10 05:27:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:38,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860452932] [2024-11-10 05:27:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:27:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:27:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:27:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:27:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:27:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:27:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:27:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:27:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:27:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:27:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:27:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:27:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:27:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:27:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:27:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:27:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:27:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:27:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:27:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:27:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:27:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:27:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:27:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:27:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:27:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:27:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:27:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:27:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:27:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:27:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860452932] [2024-11-10 05:27:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860452932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646150529] [2024-11-10 05:27:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:40,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:40,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:40,314 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-10 05:27:40,316 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-10 05:27:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:40,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 05:27:40,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 809 proven. 57 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-11-10 05:27:41,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:27:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646150529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:27:42,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:27:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 30 [2024-11-10 05:27:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615532375] [2024-11-10 05:27:42,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:42,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 05:27:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:42,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 05:27:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2024-11-10 05:27:42,503 INFO L87 Difference]: Start difference. First operand 410 states and 632 transitions. Second operand has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2024-11-10 05:27:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:54,220 INFO L93 Difference]: Finished difference Result 2486 states and 3558 transitions. [2024-11-10 05:27:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-10 05:27:54,221 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) Word has length 199 [2024-11-10 05:27:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:54,235 INFO L225 Difference]: With dead ends: 2486 [2024-11-10 05:27:54,236 INFO L226 Difference]: Without dead ends: 2079 [2024-11-10 05:27:54,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10237 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5019, Invalid=22703, Unknown=0, NotChecked=0, Total=27722 [2024-11-10 05:27:54,247 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 3290 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 4848 mSolverCounterSat, 1177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 3325 SdHoareTripleChecker+Invalid, 6025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 4848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:54,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 3325 Invalid, 6025 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1177 Valid, 4848 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-10 05:27:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-10 05:27:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 722. [2024-11-10 05:27:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 552 states have (on average 1.434782608695652) internal successors, (792), 560 states have internal predecessors, (792), 154 states have call successors, (154), 15 states have call predecessors, (154), 15 states have return successors, (154), 146 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-10 05:27:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1100 transitions. [2024-11-10 05:27:54,366 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1100 transitions. Word has length 199 [2024-11-10 05:27:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:54,367 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1100 transitions. [2024-11-10 05:27:54,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2024-11-10 05:27:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1100 transitions. [2024-11-10 05:27:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 05:27:54,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:54,371 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:54,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 05:27:54,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:54,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1082719219, now seen corresponding path program 1 times [2024-11-10 05:27:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672638286] [2024-11-10 05:27:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:27:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:27:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:27:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:27:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:27:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:27:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:27:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:27:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:27:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:27:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:27:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:27:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:27:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:27:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:27:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:27:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:27:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:27:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:27:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:27:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:27:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:27:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:27:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:27:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:27:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:27:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:27:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:27:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:27:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:27:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672638286] [2024-11-10 05:27:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672638286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650865490] [2024-11-10 05:27:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:55,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:27:55,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 05:27:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 05:27:55,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 830 proven. 108 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-11-10 05:27:56,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650865490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:57,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:27:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-10 05:27:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76125131] [2024-11-10 05:27:57,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:57,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 05:27:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 05:27:57,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-11-10 05:27:57,501 INFO L87 Difference]: Start difference. First operand 722 states and 1100 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 3 states have call successors, (60), 4 states have call predecessors, (60), 6 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-11-10 05:28:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:00,591 INFO L93 Difference]: Finished difference Result 2013 states and 2961 transitions. [2024-11-10 05:28:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-10 05:28:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 3 states have call successors, (60), 4 states have call predecessors, (60), 6 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 199 [2024-11-10 05:28:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:00,602 INFO L225 Difference]: With dead ends: 2013 [2024-11-10 05:28:00,602 INFO L226 Difference]: Without dead ends: 1294 [2024-11-10 05:28:00,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2707 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1672, Invalid=6338, Unknown=0, NotChecked=0, Total=8010 [2024-11-10 05:28:00,608 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 1373 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:00,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 1310 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 05:28:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-10 05:28:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 719. [2024-11-10 05:28:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 547 states have (on average 1.4241316270566728) internal successors, (779), 555 states have internal predecessors, (779), 154 states have call successors, (154), 17 states have call predecessors, (154), 17 states have return successors, (154), 146 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-10 05:28:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1087 transitions. [2024-11-10 05:28:00,723 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1087 transitions. Word has length 199 [2024-11-10 05:28:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:00,724 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1087 transitions. [2024-11-10 05:28:00,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 3 states have call successors, (60), 4 states have call predecessors, (60), 6 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-11-10 05:28:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1087 transitions. [2024-11-10 05:28:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:28:00,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:00,727 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:00,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 05:28:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:00,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:00,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -274831842, now seen corresponding path program 1 times [2024-11-10 05:28:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949483842] [2024-11-10 05:28:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2024-11-10 05:28:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949483842] [2024-11-10 05:28:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949483842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800888179] [2024-11-10 05:28:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:01,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:01,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:01,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:28:01,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 05:28:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 05:28:01,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 809 proven. 222 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2024-11-10 05:28:03,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 75 proven. 177 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2024-11-10 05:28:04,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800888179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:28:04,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:28:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 16] total 37 [2024-11-10 05:28:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663717996] [2024-11-10 05:28:04,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:28:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-10 05:28:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-10 05:28:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 05:28:04,944 INFO L87 Difference]: Start difference. First operand 719 states and 1087 transitions. Second operand has 37 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 11 states have call successors, (90), 5 states have call predecessors, (90), 11 states have return successors, (90), 11 states have call predecessors, (90), 11 states have call successors, (90) [2024-11-10 05:28:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:11,901 INFO L93 Difference]: Finished difference Result 2576 states and 3712 transitions. [2024-11-10 05:28:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-10 05:28:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 11 states have call successors, (90), 5 states have call predecessors, (90), 11 states have return successors, (90), 11 states have call predecessors, (90), 11 states have call successors, (90) Word has length 200 [2024-11-10 05:28:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:11,912 INFO L225 Difference]: With dead ends: 2576 [2024-11-10 05:28:11,912 INFO L226 Difference]: Without dead ends: 1860 [2024-11-10 05:28:11,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7000 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4696, Invalid=15044, Unknown=0, NotChecked=0, Total=19740 [2024-11-10 05:28:11,921 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2644 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2649 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:11,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2649 Valid, 2003 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 3223 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-10 05:28:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-10 05:28:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 512. [2024-11-10 05:28:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 389 states have (on average 1.4447300771208227) internal successors, (562), 392 states have internal predecessors, (562), 108 states have call successors, (108), 14 states have call predecessors, (108), 14 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:28:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 778 transitions. [2024-11-10 05:28:12,018 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 778 transitions. Word has length 200 [2024-11-10 05:28:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 778 transitions. [2024-11-10 05:28:12,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 11 states have call successors, (90), 5 states have call predecessors, (90), 11 states have return successors, (90), 11 states have call predecessors, (90), 11 states have call successors, (90) [2024-11-10 05:28:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 778 transitions. [2024-11-10 05:28:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:28:12,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:12,021 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:12,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 05:28:12,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:12,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:12,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:12,223 INFO L85 PathProgramCache]: Analyzing trace with hash 419008585, now seen corresponding path program 1 times [2024-11-10 05:28:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:12,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476307461] [2024-11-10 05:28:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:28:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476307461] [2024-11-10 05:28:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476307461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:12,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:28:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146799356] [2024-11-10 05:28:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:12,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:28:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:12,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:28:12,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:12,384 INFO L87 Difference]: Start difference. First operand 512 states and 778 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:12,488 INFO L93 Difference]: Finished difference Result 644 states and 979 transitions. [2024-11-10 05:28:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:28:12,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-10 05:28:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:12,493 INFO L225 Difference]: With dead ends: 644 [2024-11-10 05:28:12,493 INFO L226 Difference]: Without dead ends: 516 [2024-11-10 05:28:12,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:12,496 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:12,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:28:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-10 05:28:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2024-11-10 05:28:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 392 states have (on average 1.441326530612245) internal successors, (565), 395 states have internal predecessors, (565), 108 states have call successors, (108), 14 states have call predecessors, (108), 14 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:28:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 781 transitions. [2024-11-10 05:28:12,580 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 781 transitions. Word has length 200 [2024-11-10 05:28:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:12,581 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 781 transitions. [2024-11-10 05:28:12,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 781 transitions. [2024-11-10 05:28:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:28:12,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:12,583 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:12,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:28:12,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:12,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2133148376, now seen corresponding path program 1 times [2024-11-10 05:28:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:12,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469550422] [2024-11-10 05:28:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:28:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469550422] [2024-11-10 05:28:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469550422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572358344] [2024-11-10 05:28:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:13,229 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:28:13,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 05:28:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 05:28:13,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 932 proven. 108 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2024-11-10 05:28:14,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572358344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:17,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:28:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2024-11-10 05:28:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710208255] [2024-11-10 05:28:17,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:28:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 05:28:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 05:28:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-10 05:28:17,310 INFO L87 Difference]: Start difference. First operand 515 states and 781 transitions. Second operand has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-10 05:28:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:19,667 INFO L93 Difference]: Finished difference Result 1533 states and 2233 transitions. [2024-11-10 05:28:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-10 05:28:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 200 [2024-11-10 05:28:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:19,672 INFO L225 Difference]: With dead ends: 1533 [2024-11-10 05:28:19,672 INFO L226 Difference]: Without dead ends: 1021 [2024-11-10 05:28:19,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1503, Invalid=4503, Unknown=0, NotChecked=0, Total=6006 [2024-11-10 05:28:19,676 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 651 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:19,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1754 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 05:28:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-10 05:28:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 713. [2024-11-10 05:28:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 548 states have (on average 1.4343065693430657) internal successors, (786), 552 states have internal predecessors, (786), 144 states have call successors, (144), 20 states have call predecessors, (144), 20 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-10 05:28:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1074 transitions. [2024-11-10 05:28:19,778 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1074 transitions. Word has length 200 [2024-11-10 05:28:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:19,779 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1074 transitions. [2024-11-10 05:28:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-10 05:28:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1074 transitions. [2024-11-10 05:28:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:28:19,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:19,781 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:19,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:19,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:19,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1921797463, now seen corresponding path program 1 times [2024-11-10 05:28:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944055082] [2024-11-10 05:28:19,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:28:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944055082] [2024-11-10 05:28:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944055082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:28:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268039402] [2024-11-10 05:28:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:20,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:28:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:28:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:20,106 INFO L87 Difference]: Start difference. First operand 713 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:20,304 INFO L93 Difference]: Finished difference Result 1704 states and 2525 transitions. [2024-11-10 05:28:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:28:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-10 05:28:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:20,310 INFO L225 Difference]: With dead ends: 1704 [2024-11-10 05:28:20,310 INFO L226 Difference]: Without dead ends: 994 [2024-11-10 05:28:20,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:20,315 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 84 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:20,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:28:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-10 05:28:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 765. [2024-11-10 05:28:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 591 states have (on average 1.4077834179357023) internal successors, (832), 596 states have internal predecessors, (832), 152 states have call successors, (152), 21 states have call predecessors, (152), 21 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-10 05:28:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1136 transitions. [2024-11-10 05:28:20,456 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1136 transitions. Word has length 200 [2024-11-10 05:28:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1136 transitions. [2024-11-10 05:28:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1136 transitions. [2024-11-10 05:28:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:28:20,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:20,458 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 05:28:20,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -677032982, now seen corresponding path program 1 times [2024-11-10 05:28:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210018938] [2024-11-10 05:28:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:28:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210018938] [2024-11-10 05:28:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210018938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:20,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:28:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306041296] [2024-11-10 05:28:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:20,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:28:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:28:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:20,550 INFO L87 Difference]: Start difference. First operand 765 states and 1136 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:20,741 INFO L93 Difference]: Finished difference Result 1627 states and 2374 transitions. [2024-11-10 05:28:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:28:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-10 05:28:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:20,747 INFO L225 Difference]: With dead ends: 1627 [2024-11-10 05:28:20,747 INFO L226 Difference]: Without dead ends: 865 [2024-11-10 05:28:20,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:20,750 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 70 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:20,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 357 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:28:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-10 05:28:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 558. [2024-11-10 05:28:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 410 states have (on average 1.3414634146341464) internal successors, (550), 411 states have internal predecessors, (550), 126 states have call successors, (126), 21 states have call predecessors, (126), 21 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-10 05:28:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 802 transitions. [2024-11-10 05:28:20,865 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 802 transitions. Word has length 200 [2024-11-10 05:28:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:20,867 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 802 transitions. [2024-11-10 05:28:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 802 transitions. [2024-11-10 05:28:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:28:20,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:20,869 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:20,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 05:28:20,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:20,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 106288893, now seen corresponding path program 1 times [2024-11-10 05:28:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:20,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419389385] [2024-11-10 05:28:20,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2024-11-10 05:28:21,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419389385] [2024-11-10 05:28:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419389385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409838302] [2024-11-10 05:28:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:21,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:21,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:28:21,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 05:28:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:21,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 05:28:21,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 828 proven. 228 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 05:28:23,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 84 proven. 246 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-10 05:28:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409838302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:28:25,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:28:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 40 [2024-11-10 05:28:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566461535] [2024-11-10 05:28:25,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:28:25,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 05:28:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 05:28:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 05:28:25,730 INFO L87 Difference]: Start difference. First operand 558 states and 802 transitions. Second operand has 40 states, 37 states have (on average 4.486486486486487) internal successors, (166), 36 states have internal predecessors, (166), 13 states have call successors, (90), 6 states have call predecessors, (90), 13 states have return successors, (90), 13 states have call predecessors, (90), 13 states have call successors, (90) [2024-11-10 05:28:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:34,623 INFO L93 Difference]: Finished difference Result 1823 states and 2508 transitions. [2024-11-10 05:28:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-11-10 05:28:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.486486486486487) internal successors, (166), 36 states have internal predecessors, (166), 13 states have call successors, (90), 6 states have call predecessors, (90), 13 states have return successors, (90), 13 states have call predecessors, (90), 13 states have call successors, (90) Word has length 201 [2024-11-10 05:28:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:34,629 INFO L225 Difference]: With dead ends: 1823 [2024-11-10 05:28:34,630 INFO L226 Difference]: Without dead ends: 1268 [2024-11-10 05:28:34,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8220 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5294, Invalid=17356, Unknown=0, NotChecked=0, Total=22650 [2024-11-10 05:28:34,635 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 2149 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:34,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 1500 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 05:28:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-11-10 05:28:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 573. [2024-11-10 05:28:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 426 states have (on average 1.352112676056338) internal successors, (576), 426 states have internal predecessors, (576), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 05:28:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 816 transitions. [2024-11-10 05:28:34,800 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 816 transitions. Word has length 201 [2024-11-10 05:28:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:34,801 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 816 transitions. [2024-11-10 05:28:34,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.486486486486487) internal successors, (166), 36 states have internal predecessors, (166), 13 states have call successors, (90), 6 states have call predecessors, (90), 13 states have return successors, (90), 13 states have call predecessors, (90), 13 states have call successors, (90) [2024-11-10 05:28:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 816 transitions. [2024-11-10 05:28:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:28:34,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:34,805 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:34,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:35,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 05:28:35,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:35,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1493683259, now seen corresponding path program 1 times [2024-11-10 05:28:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694742127] [2024-11-10 05:28:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:28:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:28:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:28:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:28:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:28:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 05:28:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:28:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:28:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:28:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:28:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:28:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:28:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:28:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:28:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:28:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:28:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:28:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:28:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:28:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:28:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:28:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:28:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:28:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:28:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:28:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:28:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:28:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:28:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:28:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:28:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694742127] [2024-11-10 05:28:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694742127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:35,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:35,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:28:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446075228] [2024-11-10 05:28:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:35,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:28:35,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:35,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:28:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:35,124 INFO L87 Difference]: Start difference. First operand 573 states and 816 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:35,246 INFO L93 Difference]: Finished difference Result 576 states and 818 transitions. [2024-11-10 05:28:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:28:35,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-10 05:28:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:35,250 INFO L225 Difference]: With dead ends: 576 [2024-11-10 05:28:35,250 INFO L226 Difference]: Without dead ends: 424 [2024-11-10 05:28:35,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:35,252 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:35,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:28:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-10 05:28:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2024-11-10 05:28:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 312 states have (on average 1.3365384615384615) internal successors, (417), 312 states have internal predecessors, (417), 90 states have call successors, (90), 21 states have call predecessors, (90), 21 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 05:28:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 597 transitions. [2024-11-10 05:28:35,389 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 597 transitions. Word has length 201 [2024-11-10 05:28:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:35,390 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 597 transitions. [2024-11-10 05:28:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:28:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 597 transitions. [2024-11-10 05:28:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:28:35,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:35,392 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:35,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 05:28:35,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:35,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash 249127076, now seen corresponding path program 1 times [2024-11-10 05:28:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:35,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340432950] [2024-11-10 05:28:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:28:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185556990] [2024-11-10 05:28:35,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:35,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:35,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:35,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:28:35,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 05:28:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:28:35,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:28:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:28:35,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:28:35,837 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:28:35,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:28:35,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:36,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:36,043 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:36,179 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:28:36,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:28:36 BoogieIcfgContainer [2024-11-10 05:28:36,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:28:36,182 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:28:36,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:28:36,182 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:28:36,182 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:33" (3/4) ... [2024-11-10 05:28:36,186 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:28:36,187 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:28:36,187 INFO L158 Benchmark]: Toolchain (without parser) took 63884.60ms. Allocated memory was 144.7MB in the beginning and 717.2MB in the end (delta: 572.5MB). Free memory was 72.0MB in the beginning and 536.2MB in the end (delta: -464.2MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2024-11-10 05:28:36,187 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 144.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:28:36,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.04ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 71.8MB in the beginning and 155.2MB in the end (delta: -83.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-10 05:28:36,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.18ms. Allocated memory is still 184.5MB. Free memory was 155.2MB in the beginning and 150.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:28:36,189 INFO L158 Benchmark]: Boogie Preprocessor took 95.13ms. Allocated memory is still 184.5MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:28:36,189 INFO L158 Benchmark]: IcfgBuilder took 769.59ms. Allocated memory is still 184.5MB. Free memory was 145.8MB in the beginning and 111.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 05:28:36,190 INFO L158 Benchmark]: TraceAbstraction took 62505.39ms. Allocated memory was 184.5MB in the beginning and 717.2MB in the end (delta: 532.7MB). Free memory was 111.2MB in the beginning and 537.2MB in the end (delta: -426.1MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. [2024-11-10 05:28:36,190 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 717.2MB. Free memory was 537.2MB in the beginning and 536.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:28:36,192 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.24ms. Allocated memory is still 144.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.04ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 71.8MB in the beginning and 155.2MB in the end (delta: -83.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.18ms. Allocated memory is still 184.5MB. Free memory was 155.2MB in the beginning and 150.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.13ms. Allocated memory is still 184.5MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 769.59ms. Allocated memory is still 184.5MB. Free memory was 145.8MB in the beginning and 111.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 62505.39ms. Allocated memory was 184.5MB in the beginning and 717.2MB in the end (delta: 532.7MB). Free memory was 111.2MB in the beginning and 537.2MB in the end (delta: -426.1MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 717.2MB. Free memory was 537.2MB in the beginning and 536.2MB in the end (delta: 1.0MB). 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 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of bitwiseAnd at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed char var_1_10 = 64; [L30] signed short int var_1_11 = 5; [L31] unsigned short int var_1_12 = 4; [L32] unsigned char var_1_13 = 1; [L33] unsigned short int var_1_14 = 49632; [L34] unsigned short int var_1_15 = 0; [L35] signed char var_1_16 = 50; [L36] signed char var_1_18 = 2; [L37] signed char var_1_19 = 25; [L38] signed char var_1_20 = 10; [L39] signed char var_1_21 = 1; [L40] signed char var_1_22 = 8; [L41] unsigned long int var_1_23 = 25; [L42] unsigned short int var_1_24 = 32; [L43] signed long int var_1_26 = 50; [L44] unsigned long int var_1_27 = 8; [L45] float var_1_29 = 4.5; [L46] signed long int var_1_31 = -32; [L47] float var_1_32 = 5.75; [L48] unsigned short int var_1_37 = 2; [L49] unsigned long int var_1_39 = 5; [L50] unsigned long int var_1_43 = 2711454658; [L51] unsigned long int var_1_44 = 3606433920; [L52] signed char var_1_45 = 2; [L53] unsigned long int var_1_48 = 1; [L54] double var_1_49 = 1000000.8; [L55] signed char last_1_var_1_7 = 32; [L56] signed short int last_1_var_1_11 = 5; [L57] signed long int last_1_var_1_26 = 50; VAL [isInitial=0, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_2=10227/40, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_7 = var_1_7 [L184] last_1_var_1_11 = var_1_11 [L185] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_2=10227/40, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L134] var_1_2 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L135] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L136] var_1_3 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L137] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L138] var_1_4 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L139] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L140] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L140] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L141] var_1_5 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_6=631/10, var_1_7=32] [L142] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_6=631/10, var_1_7=32] [L143] var_1_6 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L144] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L145] var_1_10 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L146] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L147] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L147] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L148] var_1_13 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L149] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L150] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L150] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L151] var_1_14 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L152] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L153] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L153] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L154] var_1_15 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L156] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L156] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L157] var_1_18 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L158] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L159] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L159] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L160] var_1_19 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L161] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L162] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L162] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L163] var_1_20 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L164] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L165] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L165] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L167] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L168] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L168] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L169] var_1_22 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L171] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L171] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L172] var_1_24 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L174] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L174] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L175] var_1_43 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L176] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L177] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L177] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L178] var_1_44 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_44 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L179] RET assume_abort_if_not(var_1_44 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L180] CALL assume_abort_if_not(var_1_44 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L180] RET assume_abort_if_not(var_1_44 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L196] RET updateVariables() [L197] CALL step() [L61] COND FALSE !((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) [L64] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L66] var_1_27 = var_1_12 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L67] COND TRUE var_1_15 != (var_1_22 + var_1_22) [L68] var_1_29 = 63.875f VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L70] COND TRUE var_1_1 > var_1_4 [L71] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L75] COND TRUE var_1_13 && (var_1_15 >= var_1_24) [L76] var_1_37 = ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=0, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L78] COND FALSE !((- var_1_6) < var_1_5) [L85] var_1_39 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L87] COND TRUE \read(var_1_13) [L88] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L90] var_1_31 = 64 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L91] COND FALSE !(var_1_15 > (~ (var_1_12 % var_1_43))) [L96] var_1_45 = var_1_22 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L98] signed char stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L99] COND TRUE var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1) [L100] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L108] EXPR var_1_15 | ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L108] COND FALSE !((var_1_15 | ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) > var_1_12) [L113] var_1_48 = var_1_14 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L114] COND FALSE !(! var_1_13) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L119] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L120] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L124] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L129] EXPR var_1_12 & last_1_var_1_7 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L129] COND FALSE !(-4 > (var_1_12 & last_1_var_1_7)) [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L188-L189] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((last_1_var_1_11) < (((16 - 32) + (64 + var_1_10)))) ? (last_1_var_1_11) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_12)) ? (var_1_14) : (var_1_12))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < last_1_var_1_26) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.3s, OverallIterations: 13, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10968 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10933 mSDsluCounter, 12356 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10053 mSDsCounter, 4185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15121 IncrementalHoareTripleChecker+Invalid, 19306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4185 mSolverCounterUnsat, 2303 mSDtfsCounter, 15121 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3211 GetRequests, 2574 SyntacticMatches, 2 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29677 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=9, InterpolantAutomatonStates: 518, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 4865 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 3798 NumberOfCodeBlocks, 3798 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3976 ConstructedInterpolants, 0 QuantifiedInterpolants, 28841 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2314 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 33186/34800 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-10 05:28:36,413 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 05:28:36,446 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.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 be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:28:38,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:28:38,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:28:38,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:28:38,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:28:38,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:28:38,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:28:38,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:28:38,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:28:38,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:28:38,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:28:38,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:28:38,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:28:38,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:28:38,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:28:38,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:28:38,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:28:38,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:28:38,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:28:38,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:28:38,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:28:38,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:28:38,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:28:38,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:28:38,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:28:38,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:28:38,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:28:38,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:28:38,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:28:38,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:28:38,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:28:38,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:28:38,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:28:38,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:28:38,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:28:38,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:28:38,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:28:38,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:28:38,533 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:28:38,533 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:38,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:28:38,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:28:38,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:28:38,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:28:38,535 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 -> be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 [2024-11-10 05:28:38,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:28:38,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:28:38,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:28:38,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:28:38,898 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:28:38,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-10 05:28:40,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:28:40,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:28:40,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-10 05:28:40,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c623b05c/3b2abd4b38fe414cbb8e5a839943511d/FLAGc200adc60 [2024-11-10 05:28:40,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c623b05c/3b2abd4b38fe414cbb8e5a839943511d [2024-11-10 05:28:40,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:28:40,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:28:40,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:28:40,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:28:40,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:28:40,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:40" (1/1) ... [2024-11-10 05:28:40,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@910b141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:40, skipping insertion in model container [2024-11-10 05:28:40,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:40" (1/1) ... [2024-11-10 05:28:40,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:28:40,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-10 05:28:40,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:28:41,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:28:41,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-10 05:28:41,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:28:41,104 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:28:41,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41 WrapperNode [2024-11-10 05:28:41,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:28:41,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:28:41,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:28:41,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:28:41,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,168 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 05:28:41,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:28:41,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:28:41,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:28:41,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:28:41,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,212 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:28:41,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:28:41,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:28:41,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:28:41,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:28:41,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:41" (1/1) ... [2024-11-10 05:28:41,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:28:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:41,293 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-10 05:28:41,296 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-10 05:28:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:28:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:28:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:28:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:28:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:28:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start