./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercodesize_ps-cn-10_file-38.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 ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:59:12,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:59:12,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:59:12,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:59:12,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:59:13,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:59:13,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:59:13,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:59:13,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:59:13,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:59:13,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:59:13,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:59:13,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:59:13,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:59:13,009 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:59:13,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:59:13,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:59:13,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:59:13,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:59:13,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:59:13,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:59:13,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:59:13,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:59:13,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:59:13,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:59:13,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:59:13,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:59:13,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:59:13,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:59:13,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:59:13,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:59:13,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:59:13,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:13,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:59:13,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:59:13,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:59:13,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:59:13,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:59:13,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:59:13,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:59:13,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:59:13,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:59:13,015 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 -> ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 [2024-11-16 12:59:13,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:59:13,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:59:13,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:59:13,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:59:13,232 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:59:13,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-16 12:59:14,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:59:14,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:59:14,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-16 12:59:14,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1665cdf5b/0618eabbe3a04a18bde44b2ffe803469/FLAG11017bfa8 [2024-11-16 12:59:14,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1665cdf5b/0618eabbe3a04a18bde44b2ffe803469 [2024-11-16 12:59:14,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:59:14,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:59:14,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:14,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:59:14,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:59:14,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:14,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14, skipping insertion in model container [2024-11-16 12:59:14,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:14,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:59:14,867 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_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-16 12:59:14,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:14,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:59:14,924 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_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-16 12:59:14,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:14,964 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:59:14,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14 WrapperNode [2024-11-16 12:59:14,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:14,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:14,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:59:14,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:59:14,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:14,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,036 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-16 12:59:15,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:15,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:59:15,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:59:15,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:59:15,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,063 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-16 12:59:15,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:59:15,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:59:15,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:59:15,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:59:15,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (1/1) ... [2024-11-16 12:59:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:15,134 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-16 12:59:15,144 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-16 12:59:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:59:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:59:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:59:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:59:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:59:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:59:15,269 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:59:15,270 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:59:15,543 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2024-11-16 12:59:15,582 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 12:59:15,582 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:59:15,603 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:59:15,603 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:59:15,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:15 BoogieIcfgContainer [2024-11-16 12:59:15,603 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:59:15,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:59:15,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:59:15,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:59:15,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:59:14" (1/3) ... [2024-11-16 12:59:15,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70274671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:15, skipping insertion in model container [2024-11-16 12:59:15,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:14" (2/3) ... [2024-11-16 12:59:15,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70274671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:15, skipping insertion in model container [2024-11-16 12:59:15,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:15" (3/3) ... [2024-11-16 12:59:15,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-16 12:59:15,624 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:59:15,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:59:15,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:59:15,679 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;@21d49b2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:59:15,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:59:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:59:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:59:15,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:15,695 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:15,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:15,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1442810165, now seen corresponding path program 1 times [2024-11-16 12:59:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:15,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984447460] [2024-11-16 12:59:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:59:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:59:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:59:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:59:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:59:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:59:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:59:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 12:59:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:59:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:59:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:59:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:59:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:59:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:59:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:59:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:59:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 12:59:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:59:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984447460] [2024-11-16 12:59:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984447460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:16,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:59:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436250735] [2024-11-16 12:59:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:16,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:59:16,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:59:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:59:16,024 INFO L87 Difference]: Start difference. First operand has 84 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:59:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:16,054 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2024-11-16 12:59:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:59:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 173 [2024-11-16 12:59:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:16,062 INFO L225 Difference]: With dead ends: 160 [2024-11-16 12:59:16,063 INFO L226 Difference]: Without dead ends: 79 [2024-11-16 12:59:16,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-16 12:59:16,068 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:16,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:59:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-16 12:59:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-16 12:59:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:59:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-11-16 12:59:16,138 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 173 [2024-11-16 12:59:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:16,139 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-11-16 12:59:16,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:59:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-11-16 12:59:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:59:16,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:16,144 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:16,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:59:16,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:16,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -686987706, now seen corresponding path program 1 times [2024-11-16 12:59:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:16,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115030469] [2024-11-16 12:59:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:59:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:59:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:59:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:59:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:59:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:59:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:59:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 12:59:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:59:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:59:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:59:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:59:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:59:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:59:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:59:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:59:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 12:59:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:59:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115030469] [2024-11-16 12:59:16,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115030469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:16,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:16,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:59:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701548770] [2024-11-16 12:59:16,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:59:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:59:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:59:16,822 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:59:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:17,051 INFO L93 Difference]: Finished difference Result 302 states and 458 transitions. [2024-11-16 12:59:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:59:17,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-16 12:59:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:17,056 INFO L225 Difference]: With dead ends: 302 [2024-11-16 12:59:17,057 INFO L226 Difference]: Without dead ends: 226 [2024-11-16 12:59:17,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:59:17,060 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 243 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:17,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 459 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:59:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-16 12:59:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 152. [2024-11-16 12:59:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 12:59:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2024-11-16 12:59:17,103 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 173 [2024-11-16 12:59:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2024-11-16 12:59:17,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:59:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2024-11-16 12:59:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:59:17,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:17,106 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:17,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:59:17,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:17,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1210241286, now seen corresponding path program 1 times [2024-11-16 12:59:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982810489] [2024-11-16 12:59:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:59:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:59:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:59:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:59:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:59:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:59:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:59:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 12:59:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:59:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:59:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:59:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:59:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:59:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:59:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:59:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:59:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 12:59:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:59:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982810489] [2024-11-16 12:59:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982810489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:17,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:59:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853521494] [2024-11-16 12:59:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:17,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:59:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:59:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:59:17,512 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:59:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:17,758 INFO L93 Difference]: Finished difference Result 491 states and 751 transitions. [2024-11-16 12:59:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:59:17,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-16 12:59:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:17,765 INFO L225 Difference]: With dead ends: 491 [2024-11-16 12:59:17,765 INFO L226 Difference]: Without dead ends: 342 [2024-11-16 12:59:17,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:59:17,768 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 107 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:17,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 407 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:59:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-16 12:59:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 300. [2024-11-16 12:59:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 187 states have (on average 1.3101604278074865) internal successors, (245), 187 states have internal predecessors, (245), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 12:59:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 461 transitions. [2024-11-16 12:59:17,831 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 461 transitions. Word has length 174 [2024-11-16 12:59:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:17,831 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 461 transitions. [2024-11-16 12:59:17,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:59:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 461 transitions. [2024-11-16 12:59:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:59:17,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:17,836 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:17,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:59:17,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:17,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash 297310523, now seen corresponding path program 1 times [2024-11-16 12:59:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175635670] [2024-11-16 12:59:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:59:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:59:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:59:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:59:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:59:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:59:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:59:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 12:59:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:59:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:59:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:59:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:59:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:59:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:59:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:59:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:59:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 12:59:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-16 12:59:18,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175635670] [2024-11-16 12:59:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175635670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:59:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482742263] [2024-11-16 12:59:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:59:18,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:18,190 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-16 12:59:18,191 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-16 12:59:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:18,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 12:59:18,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 722 proven. 42 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-16 12:59:18,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:59:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-16 12:59:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482742263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:59:18,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:59:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-11-16 12:59:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374386709] [2024-11-16 12:59:18,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:59:18,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 12:59:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 12:59:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:59:18,996 INFO L87 Difference]: Start difference. First operand 300 states and 461 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2024-11-16 12:59:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:19,562 INFO L93 Difference]: Finished difference Result 738 states and 1119 transitions. [2024-11-16 12:59:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 12:59:19,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) Word has length 174 [2024-11-16 12:59:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:19,567 INFO L225 Difference]: With dead ends: 738 [2024-11-16 12:59:19,569 INFO L226 Difference]: Without dead ends: 441 [2024-11-16 12:59:19,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2024-11-16 12:59:19,570 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 383 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:19,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 529 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:59:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-16 12:59:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 334. [2024-11-16 12:59:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 219 states have internal predecessors, (294), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 12:59:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 510 transitions. [2024-11-16 12:59:19,618 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 510 transitions. Word has length 174 [2024-11-16 12:59:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:19,619 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 510 transitions. [2024-11-16 12:59:19,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2024-11-16 12:59:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 510 transitions. [2024-11-16 12:59:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-16 12:59:19,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:19,636 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:19,651 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-16 12:59:19,836 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-16 12:59:19,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:19,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1910759695, now seen corresponding path program 1 times [2024-11-16 12:59:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821734021] [2024-11-16 12:59:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:59:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220157215] [2024-11-16 12:59:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:59:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:19,902 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-16 12:59:19,904 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-16 12:59:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:59:20,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:59:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:59:20,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:59:20,145 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:59:20,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:59:20,162 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-16 12:59:20,352 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-16 12:59:20,356 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:59:20,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:59:20,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:59:20 BoogieIcfgContainer [2024-11-16 12:59:20,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:59:20,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:59:20,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:59:20,462 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:59:20,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:15" (3/4) ... [2024-11-16 12:59:20,464 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:59:20,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:59:20,465 INFO L158 Benchmark]: Toolchain (without parser) took 5747.97ms. Allocated memory was 136.3MB in the beginning and 253.8MB in the end (delta: 117.4MB). Free memory was 66.1MB in the beginning and 157.6MB in the end (delta: -91.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-16 12:59:20,468 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:59:20,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.10ms. Allocated memory is still 136.3MB. Free memory was 65.8MB in the beginning and 50.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:59:20,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.86ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 50.0MB in the beginning and 159.0MB in the end (delta: -108.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-16 12:59:20,468 INFO L158 Benchmark]: Boogie Preprocessor took 46.25ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 155.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:59:20,469 INFO L158 Benchmark]: IcfgBuilder took 518.91ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 132.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 12:59:20,469 INFO L158 Benchmark]: TraceAbstraction took 4856.18ms. Allocated memory was 188.7MB in the beginning and 253.8MB in the end (delta: 65.0MB). Free memory was 131.7MB in the beginning and 157.6MB in the end (delta: -25.9MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-11-16 12:59:20,469 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 253.8MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:59:20,471 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.14ms. Allocated memory is still 136.3MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.10ms. Allocated memory is still 136.3MB. Free memory was 65.8MB in the beginning and 50.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.86ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 50.0MB in the beginning and 159.0MB in the end (delta: -108.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.25ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 155.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 518.91ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 132.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4856.18ms. Allocated memory was 188.7MB in the beginning and 253.8MB in the end (delta: 65.0MB). Free memory was 131.7MB in the beginning and 157.6MB in the end (delta: -25.9MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 253.8MB. Free memory is still 157.6MB. 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 146, overapproximation of shiftRight at line 63, overapproximation of someUnaryDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 154. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_28 = 64; [L42] unsigned char var_1_29 = 0; [L43] signed long int var_1_30 = 256; [L44] unsigned short int var_1_31 = 10; [L45] float var_1_32 = -0.4; [L46] float var_1_33 = 255.8; [L47] double var_1_34 = 9.875; [L48] signed short int var_1_35 = 2; [L49] unsigned short int last_1_var_1_8 = 4; [L50] signed short int last_1_var_1_21 = -64; [L51] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L158] isInitial = 1 [L159] FCALL initially() [L160] COND TRUE 1 [L161] CALL updateLastVariables() [L149] last_1_var_1_8 = var_1_8 [L150] last_1_var_1_21 = var_1_21 [L151] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L161] RET updateLastVariables() [L162] CALL updateVariables() [L105] var_1_4 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=0, var_1_7=0, var_1_8=4] [L106] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=0, var_1_7=0, var_1_8=4] [L107] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=0, var_1_7=0, var_1_8=4] [L107] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=0, var_1_7=0, var_1_8=4] [L108] var_1_6 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_7=0, var_1_8=4] [L109] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_7=0, var_1_8=4] [L110] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L110] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L111] var_1_11 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L112] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L113] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L113] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L114] var_1_12 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L116] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L116] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L117] var_1_13 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L119] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L119] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L120] var_1_15 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L121] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L122] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L122] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L123] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L123] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L124] var_1_16 = __VERIFIER_nondet_long() [L125] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L125] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L126] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L126] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L127] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L127] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L128] var_1_17 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L129] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L130] var_1_18 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L131] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L132] var_1_19 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L133] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L134] var_1_20 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L136] var_1_26 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L137] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L138] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L139] var_1_28 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L141] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L142] var_1_30 = __VERIFIER_nondet_long() [L143] CALL assume_abort_if_not(var_1_30 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_30 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L145] var_1_33 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L162] RET updateVariables() [L163] CALL step() [L55] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L56] COND TRUE (var_1_27 + var_1_28) < ((((var_1_30) < (128)) ? (var_1_30) : (128))) [L57] var_1_29 = var_1_28 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L59] var_1_31 = var_1_28 [L60] var_1_32 = var_1_33 [L61] var_1_34 = var_1_33 [L62] var_1_35 = var_1_27 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L63] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L63] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L64] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L68] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L69] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=-1, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=4] [L70] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L75] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L77] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L78] COND TRUE \read(var_1_4) [L79] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=129/2, var_1_15=2, var_1_16=14, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L82] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L89] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=3, var_1_15=2, var_1_16=14, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L91] COND TRUE (- var_1_14) <= var_1_14 [L92] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=3, var_1_15=2, var_1_16=14, var_1_18=3, var_1_1=-255, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L100] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L101] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=3, var_1_15=2, var_1_16=14, var_1_18=3, var_1_1=-255, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L163] RET step() [L164] CALL, EXPR property() [L154] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=3, var_1_15=2, var_1_16=14, var_1_18=3, var_1_1=-255, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L154-L155] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L164] RET, EXPR property() [L164] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=3, var_1_15=2, var_1_16=14, var_1_18=3, var_1_1=-255, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=1, var_1_13=65537, var_1_14=3, var_1_15=2, var_1_16=14, var_1_18=3, var_1_1=-255, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=-255, var_1_6=512, var_1_7=0, var_1_8=65537] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 1512 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1043 mSDsCounter, 373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 373 mSolverCounterUnsat, 469 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 223 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1218 NumberOfCodeBlocks, 1218 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1036 ConstructedInterpolants, 0 QuantifiedInterpolants, 3301 SizeOfPredicates, 2 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8298/8424 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-16 12:59:20,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.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 ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:59:22,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:59:22,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:59:22,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:59:22,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:59:22,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:59:22,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:59:22,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:59:22,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:59:22,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:59:22,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:59:22,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:59:22,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:59:22,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:59:22,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:59:22,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:59:22,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:59:22,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:59:22,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:59:22,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:59:22,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:59:22,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:59:22,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:59:22,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:59:22,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:59:22,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:59:22,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:59:22,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:59:22,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:59:22,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:59:22,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:59:22,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:59:22,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:59:22,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:59:22,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:22,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:59:22,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:59:22,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:59:22,673 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:59:22,673 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:59:22,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:59:22,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:59:22,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:59:22,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:59:22,674 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 -> ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 [2024-11-16 12:59:22,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:59:22,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:59:22,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:59:22,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:59:22,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:59:22,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-16 12:59:24,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:59:24,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:59:24,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-16 12:59:24,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258165c90/3e255637bea742febb445ae02e053f52/FLAGcee5c1290 [2024-11-16 12:59:24,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258165c90/3e255637bea742febb445ae02e053f52 [2024-11-16 12:59:24,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:59:24,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:59:24,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:24,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:59:24,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:59:24,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:24" (1/1) ... [2024-11-16 12:59:24,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3435e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:24, skipping insertion in model container [2024-11-16 12:59:24,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:24" (1/1) ... [2024-11-16 12:59:24,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:59:25,100 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_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-16 12:59:25,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:25,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:59:25,181 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_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-16 12:59:25,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:25,234 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:59:25,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25 WrapperNode [2024-11-16 12:59:25,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:25,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:25,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:59:25,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:59:25,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,285 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-16 12:59:25,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:25,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:59:25,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:59:25,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:59:25,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,308 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-16 12:59:25,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:59:25,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:59:25,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:59:25,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:59:25,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (1/1) ... [2024-11-16 12:59:25,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:25,353 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-16 12:59:25,355 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-16 12:59:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:59:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:59:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:59:25,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:59:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:59:25,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:59:25,457 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:59:25,459 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:59:29,977 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 12:59:29,978 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:59:29,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:59:29,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:59:29,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:29 BoogieIcfgContainer [2024-11-16 12:59:29,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:59:29,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:59:29,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:59:30,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:59:30,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:59:24" (1/3) ... [2024-11-16 12:59:30,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f1fde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:30, skipping insertion in model container [2024-11-16 12:59:30,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:25" (2/3) ... [2024-11-16 12:59:30,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f1fde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:30, skipping insertion in model container [2024-11-16 12:59:30,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:29" (3/3) ... [2024-11-16 12:59:30,006 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-16 12:59:30,019 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:59:30,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:59:30,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:59:30,079 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;@134e8c77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:59:30,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:59:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:59:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 12:59:30,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:30,094 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:30,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:30,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1856085694, now seen corresponding path program 1 times [2024-11-16 12:59:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131335125] [2024-11-16 12:59:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:30,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:59:30,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:30,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:59:30,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:59:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:30,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:59:30,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2024-11-16 12:59:30,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:59:30,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131335125] [2024-11-16 12:59:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131335125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:30,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:59:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552117399] [2024-11-16 12:59:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:30,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:59:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:59:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:59:30,746 INFO L87 Difference]: Start difference. First operand has 77 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:59:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:30,778 INFO L93 Difference]: Finished difference Result 146 states and 254 transitions. [2024-11-16 12:59:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:59:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-11-16 12:59:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:30,789 INFO L225 Difference]: With dead ends: 146 [2024-11-16 12:59:30,789 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 12:59:30,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-16 12:59:30,797 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:30,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:59:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 12:59:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-16 12:59:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:59:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-16 12:59:30,834 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 170 [2024-11-16 12:59:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:30,835 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-16 12:59:30,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:59:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-16 12:59:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 12:59:30,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:30,838 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:30,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:59:31,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:59:31,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:31,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -817758590, now seen corresponding path program 1 times [2024-11-16 12:59:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673509691] [2024-11-16 12:59:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:31,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:59:31,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:31,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:59:31,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:59:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:31,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:59:31,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:59:32,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:59:32,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673509691] [2024-11-16 12:59:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673509691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:32,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:32,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:59:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978352360] [2024-11-16 12:59:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:32,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:59:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:59:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:59:32,667 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:59:36,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:39,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:39,573 INFO L93 Difference]: Finished difference Result 326 states and 493 transitions. [2024-11-16 12:59:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:59:39,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2024-11-16 12:59:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:39,578 INFO L225 Difference]: With dead ends: 326 [2024-11-16 12:59:39,578 INFO L226 Difference]: Without dead ends: 257 [2024-11-16 12:59:39,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:59:39,579 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 180 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:39,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 581 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-16 12:59:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-16 12:59:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 138. [2024-11-16 12:59:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 12:59:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 210 transitions. [2024-11-16 12:59:39,619 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 210 transitions. Word has length 170 [2024-11-16 12:59:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 210 transitions. [2024-11-16 12:59:39,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:59:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 210 transitions. [2024-11-16 12:59:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 12:59:39,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:39,622 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:59:39,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 12:59:39,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:59:39,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:39,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 673363619, now seen corresponding path program 1 times [2024-11-16 12:59:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591582279] [2024-11-16 12:59:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:59:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:39,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:59:39,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 12:59:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 12:59:40,228 INFO L278 TraceCheckSpWp]: Computing forward predicates...